Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem

DOI10.1016/J.AMC.2005.11.012zbMath1101.65060OpenAlexW2111535965MaRDI QIDQ2496370

Hui Wang, Zheng-Hai Huang

Publication date: 12 July 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.012

zbMATH Keywords

global convergencelinear programmingcomplementarity problemsline searchsmoothing algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

A homogeneous smoothing-type algorithm for symmetric cone linear programs ⋮ A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties ⋮ Extension of smoothing Newton algorithms to solve linear programming over symmetric cones

Cites Work

• Unnamed Item
• Stable monotone variational inequalities
• Complementarity problems over cones with monotone and pseudomonotone maps
• Improved smoothing-type methods for the solution of linear programs
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A smoothing Newton method for general nonlinear complementarity problems
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• Smoothing methods for convex inequalities and linear complementarity problems
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
• On Smoothing Methods for the P₀ Matrix Linear Complementarity Problem
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.

This page was built for publication: Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem