Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Comput Optim Appl

Search In Journal Title:

Abbravation: Computational Optimization and Applications

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s00503-010-1927-8

Search In DOI:

ISSN

1573-2894

Search In ISSN:
Search In Title Of Papers:

Some noninterior pathfollowing methods based on 

Authors: Wang Qinggang Zhao Jinling Yang Qingzhi
Publish Date: 2008/06/13
Volume: 46, Issue: 1, Pages: 31-49
PDF Link

Abstract

In this paper we present some noninterior pathfollowing methods for linear complementarity problems Instead of using the standard central path we use a scaled central path Based on this new central path we first give a feasible noninterior pathfollowing method for linear complementarity problems And then we extend it to an infeasible method After proving the boundedness of the neighborhood we prove the convergence of our method Another point we should present is that we prove the local quadratic convergence of feasible method without the assumption of strict complementarity at the solution

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A benchmark library and a comparison of heuristic methods for the linear ordering problem
  2. Compression and denoising using l 0 -norm
  3. AAR-based decomposition algorithm for non-linear convex optimisation
  4. Classification of companies using maximal margin ellipsoidal surfaces
  5. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
  6. Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
  7. Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
  8. Numerical experiments with an inexact Jacobian trust-region algorithm
  9. An interior-point approach for primal block-angular problems
  10. Computing the metric dimension of graphs by genetic algorithms
  11. On the resolution of certain discrete univariate max–min problems
  12. A coordinate gradient descent method for ℓ 1 -regularized convex minimization
Search Result: