Towards non-symmetric conic optimization
From MaRDI portal
Publication:5200566
DOI10.1080/10556788.2011.567270zbMath1260.90129OpenAlexW2058404049MaRDI QIDQ5200566
Publication date: 6 November 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.567270
convex optimizationinterior-point methodsself-concordant barriersself-scaled barriers\(p\)-norm minimizationaffine-scaling directionconic problemslong-step path-following methods
Related Items
An algorithm for nonsymmetric conic optimization inspired by MOSEK, The algebraic structure of the arbitrary-order cone, A path following interior-point method for linear complementarity problems over circular cones, 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, Polyhedral approximations inp-order cone programming, The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\), Linear optimization over homogeneous matrix cones, Performance enhancements for a generic conic interior point algorithm, Matrix-Free Convex Optimization Modeling, Quantum theory in finite dimension cannot explain every general process with finite memory, Unnamed Item, Sum-of-Squares Optimization without Semidefinite Programming, Inexact proximal Newton methods for self-concordant functions, A self-concordant exponential kernel function for primal–dual interior-point algorithm, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, The decompositions with respect to two core non-symmetric cones, A polynomial-time interior-point method for circular cone programming based on kernel functions, A nonmonotone smoothing Newton method for circular cone programming, Characterizations of Boundary Conditions on Some Non-Symmetric Cones, Primal-dual interior-point algorithms for convex quadratic circular cone optimization, On self-concordant barriers for generalized power cones, On \(p\)-norm linear discrimination
Cites Work
- Long-step strategies in interior-point primal-dual methods
- Introductory lectures on convex optimization. A basic course.
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- On self-concordant barrier functions for conic hulls and fractional programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- 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
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Efficient Algorithm for Minimizing a Sum of p-Norms
