A polyhedral approximation algorithm for recession cones of spectrahedral shadows

Cites Work

CVXPY: a Python-embedded modeling language for convex optimization
Vector Optimization with Infimum and Supremum
The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Title not available (Why is that?)
Variational Analysis
Convex Analysis
Title not available (Why is that?)
An exact duality theory for semidefinite programming and its complexity implications
Scalarizing vector optimization problems
Analysis of an algorithm for approximating convex bodies
The Cutting-Plane Method for Solving Convex Programs
Title not available (Why is that?)
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Cones and duality
Nonconvex separation theorems and some applications in vector optimization
Extremal structure of convex sets
Classroom examples of robustness problems in geometric computations
Newton's method for convex programming and Tschebyscheff approximation
Approximation methods in multiobjective programming
Linear matrix inequality representation of sets
Variable ordering structures in vector optimization
Some geometric results in semidefinite programming
Distances between closed convex cones: old and new results
Solution concepts in vector optimization: a fresh look at an old story
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
The Supporting Hyperplane Method for Unimodal Programming
Primal and dual approximation algorithms for convex vector optimization problems
An approximation algorithm for convex multi-objective programming problems
An outer approximation method for globally minimizing a concave function over a compact convex set
Title not available (Why is that?)
Functional analysis
Semidefinite Representation for Convex Hulls of Real Algebraic Curves
On outer approximation methods for solving concave minimization problems
Title not available (Why is that?)
Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
Extensions of Radstrom's lemma with application to stability theory of mathematical programming
Cutting exponents for polyhedral approximations to convex bodies
The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
Algorithms to Solve Unbounded Convex Vector Optimization Problems
Title not available (Why is that?)
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
A norm minimization-based convex vector optimization algorithm
Title not available (Why is that?)
Sum of squares: theory and applications. AMS short course, Baltimore, MD, USA, January 14--15, 2019
Double description method revisited

This page was built for publication: A polyhedral approximation algorithm for recession cones of spectrahedral shadows

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