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