Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem

DOI10.1007/S10107-006-0010-7MaRDI QIDQ985306zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chee-Khian Sim, Gongyun Zhao

Publication date 21 July 2010

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

Full work available at URL https://doi.org/10.1007/s10107-006-0010-7

zbMATH Keywords

ordinary differential equationsanalytic curveoff-central paths

Mathematics Subject Classification ID

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

Recommendations

• A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
• Path-following interior-point algorithm for monotone linear complementarity problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• An interior point method for solving monotone linear complementarity problem
• An infeasible interior point method for the monotone linear complementarity problem
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• A generalized direction in interior point method for monotone linear complementarity problems
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

Cites work

• scientific article; zbMATH DE number 3116993 (Why is no real title available?)
• scientific article; zbMATH DE number 4199964 (Why is no real title available?)
• scientific article; zbMATH DE number 3292104 (Why is no real title available?)
• A New Notion of Weighted Centers for Semidefinite Programming
• A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
• A modified layered-step interior-point algorithm for linear programming
• A primal-dual interior point method whose running time depends only on the constraint matrix
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Analyticity of the central path at the boundary point in semidefinite programming
• Asymptotic Behavior of Continuous Trajectories for Primal-Dual Potential-Reduction Methods
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• High order infeasible-interior-point methods for solving sufficient linear complementarity problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Limiting behavior of weighted central paths in linear programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• On the Nesterov--Todd Direction in Semidefinite Programming
• On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• On the complexity of following the central path of linear programs by linear extrapolation. II
• On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
• On two interior-point mappings for nonlinear semidefinite complementarity problems
• Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Properties of an Interior-Point Mapping for Mixed Complementarity Problems
• Quadratic Convergence in a Primal-Dual Method
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
• Superlinear convergence of interior-point algorithms for semidefinite programming
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The curvature integral and the complexity of linear complementarity problems

Cited in

(14)

• Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems
• The convergent generalized central paths for linearly constrained convex programming
• Path-following interior-point algorithm for monotone linear complementarity problems
• Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• A generalized direction in interior point method for monotone linear complementarity problems
• Low-order penalty equations for semidefinite linear complementarity problems
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
• Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction
• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
• Complementarity problems over symmetric cones: A survey of recent developments in several aspects
• Dynamical system characterization of the central path and its variants -- a revisit

This page was built for publication: Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem

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