On a homogeneous algorithm for the monotone complementarity problem

DOI10.1007/s101070050027zbMath0972.90078OpenAlexW2094161173MaRDI QIDQ1572684

Yinyu Ye, Erling D. Andersen

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050027

zbMATH Keywords

monotone complementarity probleminfeasible-starting algorithmhomogeneous and self-dual

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones, Embedding methods for semidefinite programming, An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, An algorithm for nonsymmetric conic optimization inspired by MOSEK, The practical behavior of the homogeneous self-dual formulations in interior point methods, A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, Initialization in semidefinite programming via a self-dual skew-symmetric embedding, Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones, A new primal-dual interior-point algorithm for convex quadratic optimization, A CHANCE-CONSTRAINED PORTFOLIO SELECTION PROBLEM UNDER t-DISTRIBUTION, A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones, A homogeneous smoothing-type algorithm for symmetric cone linear programs, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, A homogeneous model for monotone mixed horizontal linear complementarity problems, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, Interior Point Methods for Nonlinear Optimization, OPTIMAL HARVESTING OF FOREST AGE CLASSES: A SURVEY OF SOME RECENT RESULTS, Integrating design and production planning considerations in multi-bay manufacturing facility layout, An infeasibility certificate for nonlinear programming based on Pareto criticality condition, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, On implementation of a self-dual embedding method for convex programming, An adaptive infeasible interior-point algorithm for linear complementarity problems, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones, Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity