On a homogeneous algorithm for the monotone complementarity problem

DOI10.1007/S101070050027MaRDI QIDQ1572684zbMATH OpenOpenAlexFDO

Authors E. D. Andersen, Yinyu Ye

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

homogeneous and self-dualinfeasible-starting algorithmmonotone complementarity problem

Mathematics Subject Classification ID

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

Recommendations

• On homogeneous and self-dual algorithms for LCP
• scientific article; zbMATH DE number 1059215
• A computational study of the homogeneous algorithm for large-scale convex optimization
• A simplified homogeneous and self-dual linear programming algorithm and its implementation
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence

Cited in

(41)

• A computational study of the homogeneous algorithm for large-scale convex optimization
• On homogeneous and self-dual algorithms for LCP
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
• 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
• An infeasibility certificate for nonlinear programming based on Pareto criticality condition
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
• An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
• Complementarity problems over symmetric cones: A survey of recent developments in several aspects
• Embedding methods for semidefinite programming
• The practical behavior of the homogeneous self-dual formulations in interior point methods
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
• On implementation of a self-dual embedding method for convex programming
• A CHANCE-CONSTRAINED PORTFOLIO SELECTION PROBLEM UNDER t-DISTRIBUTION
• Interior Point Methods for Nonlinear Optimization
• scientific article; zbMATH DE number 5564090 (Why is no real title available?)
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
• scientific article; zbMATH DE number 4062853 (Why is no real title available?)
• The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
• scientific article; zbMATH DE number 1059215 (Why is no real title available?)
• scientific article; zbMATH DE number 1744789 (Why is no real title available?)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
• OPTIMAL HARVESTING OF FOREST AGE CLASSES: A SURVEY OF SOME RECENT RESULTS
• A homogeneous smoothing-type algorithm for symmetric cone linear programs
• Operator splitting for a homogeneous embedding of the linear complementarity problem
• Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• Infeasible Mehrotra-type predictor-corrector algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• An algorithm for nonsymmetric conic optimization inspired by MOSEK
• A new primal-dual interior-point algorithm for convex quadratic optimization
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
• scientific article; zbMATH DE number 6402146 (Why is no real title available?)
• Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method
• A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
• Integrating design and production planning considerations in multi-bay manufacturing facility layout
• Comprehensive analysis of kernel-based interior-point methods for the P_*()-LCP
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• A new path-following algorithm for nonlinear P_* complementarity problems
• A homogeneous model for mixed complementarity problems over symmetric cones

This page was built for publication: On a homogeneous algorithm for the monotone complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572684)