A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
From MaRDI portal
Publication:2340336
Recommendations
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- Towards non-symmetric conic optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
Cited in
(47)- A computational study of the homogeneous algorithm for large-scale convex optimization
- A path following interior-point method for linear complementarity problems over circular cones
- Semidefinite approximations of the matrix logarithm
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- On merit functions for \(p\)-order cone complementarity problem
- Newton polytopes and relative entropy optimization
- On self-concordant barriers for generalized power cones
- 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
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- The decompositions with respect to two core non-symmetric cones
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\)
- Relative entropy relaxations for signomial optimization
- A nonmonotone smoothing Newton method for circular cone programming
- A self-concordant interior point algorithm for nonsymmetric circular cone programming
- Matrix-free convex optimization modeling
- HOMOGENEOUS SELF-DUAL METHODS FOR SYMMETRIC CONES UNDER UNCERTAINTY
- Conic optimization via operator splitting and homogeneous self-dual embedding
- scientific article; zbMATH DE number 5943354 (Why is no real title available?)
- scientific article; zbMATH DE number 5564090 (Why is no real title available?)
- Sum-of-squares optimization without semidefinite programming
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- Solving Natural Conic Formulations with Hypatia.jl
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Primal-dual interior-point methods for domain-driven formulations
- Distributionally robust optimization with infinitely constrained ambiguity sets
- Towards non-symmetric conic optimization
- Characterizations of boundary conditions on some non-symmetric cones
- Convergence of anisotropic mesh adaptation via metric optimization
- Sum of squares generalizations for conic sets
- Error bounds, facial residual functions and applications to the exponential cone
- Linear optimization over homogeneous matrix cones
- A new perspective on low-rank optimization
- Performance enhancements for a generic conic interior point algorithm
- A homogeneous predictor-corrector algorithm for stochastic nonsymmetric convex conic optimization with discrete support
- Computing conjugate barrier information for nonsymmetric cones
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Interior point methods in the year 2025
- Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
- Mixed-integer exponential conic optimization for reliability enhancement of power distribution systems
- An efficient implementation of interior-point methods for a class of nonsymmetric cones
- IPRSOCP: a primal-dual interior-point relaxation algorithm for second-order cone programming
- Interior point methods for structured quantum relative entropy optimization problems
- Dual certificates of primal cone membership
- A polynomial-time interior-point method for circular cone programming based on kernel functions
This page was built for publication: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340336)
