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

scientific article

Language	Label	Description	Also known as
English	Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

12 July 2006

0 references

zbMATH Keywords

linear programming

0 references

complementarity problems

0 references

smoothing algorithm

0 references

global convergence

0 references

line search

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2005.11.012

0 references

cites work

The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems

0 references

A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

0 references

A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP

0 references

Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.

0 references

Smoothing methods for convex inequalities and linear complementarity problems

0 references

A class of smoothing functions for nonlinear and mixed complementarity problems

0 references

On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities

0 references

On Smoothing Methods for the P0 Matrix Linear Complementarity Problem

0 references

Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter

0 references

Improved smoothing-type methods for the solution of linear programs

0 references

Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems

0 references

Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem

0 references

Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

0 references

The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP

0 references

Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function

0 references

Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP

0 references

A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties

0 references

Some Noninterior Continuation Methods for Linear Complementarity Problems

0 references

Complementarity problems over cones with monotone and pseudomonotone maps

0 references

Stable monotone variational inequalities

0 references

A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions

0 references

A smoothing Newton method for general nonlinear complementarity problems

0 references

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

0 references

Q4252833

0 references

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

0 references

A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs

0 references

Identifiers

zbMATH Open document ID

1101.65060

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.AMC.2005.11.012

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2496370