On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems

DOI10.1007/s10898-004-6098-5zbMath1093.90064OpenAlexW1999276452MaRDI QIDQ811890

Zheng-Hai Huang, Ş. İlker Birbil, Shu-Cherng Fang, Ji-ye Han

Publication date: 23 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-6098-5

zbMATH Keywords

Entropy functionFinite terminationNon-interior continuation methodSmoothing approximationVertical linear complementarity problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Finite termination of a Newton-type algorithm for a class of affine variational inequality problems, An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix, Entropy function-based algorithms for solving a class of nonconvex minimization problems

Cites Work

• Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
• On the finite convergence of interior-point algorithms for linear programming
• On the convergence of the exponential multiplier method for convex programming
• Approximation procedures based on the method of multipliers
• Regularized smoothing approximations to vertical nonlinear complementarity problems
• The generalized Leontief input-output model and its application to the choice of new technology
• Finding an interior point in the optimal face of linear programs
• On the entropic regularization method for solving min-max problems with applications
• Non-interior continuation method for solving the monotone semidefinite complementarity problem
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• A generalization of the Nash equilibrium theorem on bimatrix games
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• On the entropic perturbation and exponential penalty methods for linear programming
• A non-interior continuation method for generalized linear complementarity problems
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• The Generalized Order Linear Complementarity Problem
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
• A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
• A generalization of the linear complementarity problem
• Piecewise-Linear Theory of Nonlinear Networks