Primal-Dual Interior-Point Methods for Domain-Driven Formulations
From MaRDI portal
Publication:5119848
zbMath1455.90127arXiv1804.06925MaRDI QIDQ5119848
Publication date: 1 September 2020
Full work available at URL: https://arxiv.org/abs/1804.06925
Convex programming (90C25) Interior-point methods (90C51) Duality theory (optimization) (49N15) Complexity and performance of numerical algorithms (65Y20)
Related Items
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 ⋮ Linear optimization over homogeneous matrix cones ⋮ Optimal Self-Concordant Barriers for Quantum Relative Entropies ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Entropy constraints for ground energy optimization ⋮ The decompositions with respect to two core non-symmetric cones ⋮ Solving SDP completely with an interior point oracle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative entropy optimization and its applications
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Nuclear norm minimization for the planted clique and biclique problems
- Lectures on convex optimization
- A new polynomial-time algorithm for linear programming
- All convex invariant functions of hermitian matrices
- 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
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Entropy optimization and mathematical programming
- Convex optimization problems involving finite autocorrelation sequences
- The mathematics of eigenvalue optimization
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Semidefinite approximations of the matrix logarithm
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- Robust optimization-methodology and applications
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- Lectures on Modern Convex Optimization
- Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods
- Relative Entropy Relaxations for Signomial Optimization
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms 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
- Linear Matrix Inequalities in System and Control Theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Efficient optimization of the quantum relative entropy
- Towards non-symmetric conic optimization
- Compressed sensing
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
