Advances in convex optimization: conic programming
From MaRDI portal
Recommendations
Cited in
(59)- Applications of convex optimization in signal processing and digital communication
- Livsic-type determinantal representations and hyperbolicity
- The tropical analogue of the Helton-Nie conjecture is true
- Conic programming models for production planning with clearing functions: formulations and duality
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\)
- Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- A comparison of optimization solvers for log binomial regression including conic programming
- Self-similar Hessian and conformally Kähler manifolds
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Introduction to semidefinite, conic and polynomial optimization
- Invariant Semidefinite Programs
- The state-of-the-art in conic optimization software
- LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
- Matrix positivity preservers in fixed dimension. I
- Genericity results in linear conic programming -- a tour d'horizon
- Recent advances in structural optimization
- A panorama of positivity. II: Fixed dimension
- Realizations of non-commutative rational functions around a matrix centre. I: synthesis, minimal realizations and evaluation on stably finite algebras
- scientific article; zbMATH DE number 1975312 (Why is no real title available?)
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
- Every convex free basic semi-algebraic set has an LMI representation
- On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Spectrahedral shadows
- Semidefinite Approximation of Closed Convex Set
- A guide to conic optimisation and its applications
- Techniques of linear programming based on the theory of convex cones
- The Evolution of Methods of Convex Optimization
- Convex Algebraic Geometry of Curvature Operators
- Bounds on heat transport for convection driven by internal heating
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- On the sign patterns of entrywise positivity preservers in fixed dimension
- Lifting for simplicity: concise descriptions of convex sets
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- Schur polynomials and matrix positivity preservers
- Matrix positivity preservers in fixed dimension
- A matrix Positivstellensatz with lifting polynomials
- Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions
- Linear optimization over homogeneous matrix cones
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Lagrangian duality in convex conic programming with simple proofs
- Convex hulls of curves of genus one
- Semi-definite programming and quantum information
- Global minimization of polynomial integral functionals
- Set-limited functions and polynomial-time interior-point methods
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- Strictly stable Hurwitz polynomials and their determinantal representations
- Special Vinberg cones of rank 4
- A refinement of Hilbert's 1888 theorem: separating cones along the Veronese variety
- Sums of squares of polynomials with rational coefficients
- Uniqueness results for minimal enclosing ellipsoids
- Space tensor conic programming
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
- Real root finding for determinants of linear matrices
- Convergence properties of constrained linear system under MPC control law using affine disturbance feedback
This page was built for publication: Advances in convex optimization: conic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5421709)