Status determination by interior-point methods for convex optimization problems in domain-driven form

DOI10.1007/s10107-021-01663-wzbMath1494.90079arXiv1901.07084OpenAlexW3173759678MaRDI QIDQ2149574

Mehdi Karimi, Tunçel, Levent

Publication date: 29 June 2022

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

Full work available at URL: https://arxiv.org/abs/1901.07084

zbMATH Keywords

convex optimizationinterior-point methodsduality theoryprimal-dual algorithmsstatus determination

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Duality theory (optimization) (49N15) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• SeDuMi
• SDPT3
• DDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A little theorem of the big \({\mathcal M}\) in interior point algorithms
• Lectures on convex optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• A tutorial on geometric programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A primal-dual infeasible-interior-point algorithm for linear programming
• It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
• Some perturbation theory for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
• Convex optimization problems involving finite autocorrelation sequences
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
• A simplified homogeneous and self-dual linear programming algorithm and its implementation
• Strong duality and minimal representations for cone optimization
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• On the behavior of the homogeneous self-dual model for conic convex optimization
• On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Conic convex programming and self-dual embedding
• Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m^10/7 log W) Time (Extended Abstract)
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations
• Towards non-symmetric conic optimization
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form

This page was built for publication: Status determination by interior-point methods for convex optimization problems in domain-driven form