Computing conjugate barrier information for nonsymmetric cones
From MaRDI portal
Publication:6596336
DOI10.1007/S10957-022-02076-1MaRDI QIDQ6596336
E. D. Andersen, J. P. Vielma, L. Kapelevich
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on convex optimization
- 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
- On self-concordant barriers for generalized power cones
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- 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
- CSDP, A C library for semidefinite programming
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- An Introduction to Numerical Analysis
- Solving Natural Conic Formulations with Hypatia.jl
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Towards non-symmetric conic optimization
- Logarithmic barriers for sparse matrix cones
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
This page was built for publication: Computing conjugate barrier information for nonsymmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596336)