Homotopy methods for convex optimization

Cites work

A mathematical view of interior-point methods in convex optimization
A Note on Hyperbolic Polynomials.
Conditional lower bounds on the spectrahedral representation of explicit hyperbolicity cones
CVXPY: a Python-embedded modeling language for convex optimization
Exact algorithms for semidefinite programs with degenerate feasible set
Exponential lower bounds on spectrahedral representations of hyperbolicity cones
Foreword. What is numerical algebraic geometry?
Geometry of Linear Matrix Inequalities
Homotopy Continuation Methods for Nonlinear Complementarity Problems
Homotopy techniques in linear programming
scientific article; zbMATH DE number 3146819 (Why is no real title available?)
scientific article; zbMATH DE number 4041641 (Why is no real title available?)
scientific article; zbMATH DE number 729680 (Why is no real title available?)
scientific article; zbMATH DE number 953044 (Why is no real title available?)
scientific article; zbMATH DE number 2107836 (Why is no real title available?)
scientific article; zbMATH DE number 964349 (Why is no real title available?)
Hyperbolic programs, and their derivative relaxations
Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
Hyperbolicity preservers and majorization
Lectures on convex optimization
Numerical algebraic geometry and semidefinite programming
On a new homotopy continuation trajectory for nonlinear complementary problems.
Semidefinite representation of convex sets
Semidefinite representation of the \(k\)-ellipse
Smooth hyperbolicity cones are spectrahedral shadows
The Homotopy Principle and Algorithms for Linear Programming
The Lax conjecture is true

This page was built for publication: Homotopy methods for convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962918)