A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization

DOI10.1007/s10107-021-01631-4zbMath1494.90128OpenAlexW3133541217WikidataQ115606181 ScholiaQ115606181MaRDI QIDQ2149553

Joachim Dahl, Erling D. Andersen

Publication date: 29 June 2022

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

Full work available at URL: https://doi.org/10.1007/s10107-021-01631-4

zbMATH Keywords

interior-point methodsexponential-cone optimizationnonsymmetric cone optimization

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

Algebraic Perspectives on Signomial Optimization, An algorithm for nonsymmetric conic optimization inspired by MOSEK, Linear optimization over homogeneous matrix cones, Performance enhancements for a generic conic interior point algorithm, Projection onto the exponential cone: a univariate root-finding problem, Quantum theory in finite dimension cannot explain every general process with finite memory, Unnamed Item, Designing of Morlet wavelet as a neural network for a novel prevention category in the HIV system

Uses Software

• SeDuMi
• CVXOPT
• ECOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• On a homogeneous algorithm for the monotone complementarity problem
• ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
• Presolving in linear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• Extended Formulations in Mixed-Integer Convex Programming
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
• On the Implementation of a Primal-Dual Interior Point Method
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations
• Towards non-symmetric conic optimization
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form