Solving Natural Conic Formulations with Hypatia.jl
From MaRDI portal
Publication:5058009
DOI10.1287/IJOC.2022.1202OpenAlexW3182400646MaRDI QIDQ5058009FDOQ5058009
Authors: Chris Coey, L. Kapelevich, J. P. Vielma 
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.01136
Recommendations
- scientific article; zbMATH DE number 773161
- Solving conic systems via projection and rescaling
- Conical: an extended module for computing a numerically satisfactory pair of solutions of the differential equation for conical functions
- Solving conics over functions fields
- Conic fitting in geometric algebra setting
- Computing approximate solutions for convex conic systems of constraints
- Conics as axes and Jacobian problem
- Solving second-order conic systems with variable precision
- scientific article; zbMATH DE number 1058207
- scientific article; zbMATH DE number 4009671
Cites Work
- CSDP, A C library for semidefinite programming
- CVXPY
- Julia
- CVXPY: a Python-embedded modeling language for convex optimization
- SCS
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Convex.jl
- GitHub
- Title not available (Why is that?)
- MathOptInterface.jl
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Towards non-symmetric conic optimization
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Barrier Functions in Interior Point Methods
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Extended formulations in mixed-integer convex programming
- Outer approximation with conic certificates for mixed-integer convex problems
- Disciplined geometric programming
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Sum-of-squares optimization without semidefinite programming
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
Cited In (10)
- An efficient algorithm for optimal routing through constant function market makers
- Error bounds, facial residual functions and applications to the exponential cone
- Exploiting constant trace property in large-scale polynomial optimization
- Computing conjugate barrier information for nonsymmetric cones
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Performance enhancements for a generic conic interior point algorithm
- Sum of squares generalizations for conic sets
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Hypatia.jl
- Entropy constraints for ground energy optimization
Uses Software
This page was built for publication: Solving Natural Conic Formulations with Hypatia.jl
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058009)
