Towards non-symmetric conic optimization
From MaRDI portal
Publication:5200566
Recommendations
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- Interior-point methods for optimization
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
Cites work
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Introductory lectures on convex optimization. A basic course.
- Long-step strategies in interior-point primal-dual methods
- On self-concordant barrier functions for conic hulls and fractional programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
Cited in
(31)- The decompositions with respect to two core non-symmetric cones
- On \(p\)-norm linear discrimination
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- Solving Natural Conic Formulations with Hypatia.jl
- A path following interior-point method for linear complementarity problems over circular cones
- Primal-dual interior-point methods for domain-driven formulations
- Linear optimization over homogeneous matrix cones
- On self-concordant barriers for generalized power cones
- A polynomial-time interior-point method for conic optimization, with inexact barrier evaluations
- Characterizations of boundary conditions on some non-symmetric cones
- The algebraic structure of the arbitrary-order cone
- A nonmonotone smoothing Newton method for circular cone programming
- scientific article; zbMATH DE number 7352423 (Why is no real title available?)
- The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\)
- Polyhedral approximations in \(p\)-order cone programming
- Quantum theory in finite dimension cannot explain every general process with finite memory
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- Sum-of-squares optimization without semidefinite programming
- Inexact proximal Newton methods for self-concordant functions
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A self-concordant exponential kernel function for primal-dual interior-point algorithm
- A homogeneous predictor-corrector algorithm for stochastic nonsymmetric convex conic optimization with discrete support
- Computing conjugate barrier information for nonsymmetric cones
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Matrix-free convex optimization modeling
- Performance enhancements for a generic conic interior point algorithm
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- 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
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
This page was built for publication: Towards non-symmetric conic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200566)
