Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
From MaRDI portal
Publication:1572675
DOI10.1007/s10107980009azbMath0971.90061OpenAlexW2114408464MaRDI QIDQ1572675
Yinyu Ye, Yu. E. Nesterov, Michael J. Todd
Publication date: 21 July 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/9040
convex programmingprimal-dual interior-point algorithmshomogeneous self-dual modelinfeasibility detectioninfeasible-start methods
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)
Related Items (32)
Embedding methods for semidefinite programming ⋮ An algorithm for nonsymmetric conic optimization inspired by MOSEK ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ Solving Natural Conic Formulations with Hypatia.jl ⋮ A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Interior-point methods: An old and new approach to nonlinear programming ⋮ A primal-dual symmetric relaxation for homogeneous conic systems ⋮ Facial Reduction and Partial Polyhedrality ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Barrier subgradient method ⋮ A complementarity partition theorem for multifold conic systems ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Numerical algebraic geometry and semidefinite programming ⋮ Some convex programs without a duality gap ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods ⋮ An interior point-proximal method of multipliers for convex quadratic programming ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ An infeasibility certificate for nonlinear programming based on Pareto criticality condition ⋮ Interior-point methods for optimization ⋮ Space tensor conic programming ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ Primal central paths and Riemannian distances for convex sets ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Solving SDP completely with an interior point oracle ⋮ Error Bounds and Singularity Degree in Semidefinite Programming
Uses Software
This page was built for publication: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
