A guide to conic optimisation and its applications
From MaRDI portal
(Redirected from Publication:4634309)
Recommendations
- Advances in convex optimization: conic programming
- Introduction to semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 1975312
- Copositive optimization -- recent developments and applications
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
Cites work
- A boundary point method to solve semidefinite programs
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A Spectral Bundle Method for Semidefinite Programming
- A unifying framework for several cutting plane methods for semidefinite programming
- Algebraic and geometric ideas in the theory of discrete optimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An exact duality theory for semidefinite programming and its complexity implications
- An extended conic formulation for geometric optimization
- Applications of second-order cone programming
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorial properties and the complexity of a max-cut approximation
- Complementarity and nondegeneracy in semidefinite programming
- Complexity results for the gap inequalities for the max-cut problem
- Computable representations for convex hulls of low-dimensional quadratic forms
- Computing the nearest correlation matrix--a problem from finance
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Conic formulation for l_p-norm optimization
- Copositive programming
- Dual quadratic estimates in polynomial and Boolean programming
- Euclidean distance geometry and applications
- Fixing Variables in Semidefinite Relaxations
- Gap inequalities for the cut polytope
- Geometric algorithms and combinatorial optimization
- Geometry of cuts and metrics
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 1534298 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3069632 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior point methods 25 years later
- Interior point methods for second-order cone programming and OR applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Introduction to global optimization.
- Local minima and convergence in low-rank semidefinite programming
- Nonlinear programming
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- On a positive semidefinite relaxation of the cut polytope
- On convex relaxations for quadratically constrained quadratic programming
- On nonconvex quadratic programming with box constraints
- On Polyhedral Approximations of the Second-Order Cone
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the facial structure of set packing polyhedra
- On the Shannon capacity of a graph
- Regularization methods for semidefinite programming
- Relative entropy optimization and its applications
- Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
- Robust solutions of uncertain linear programs
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- Second-order cone programming
- Semidefinite optimization
- Semidefinite programming
- Semidefinite Programming
- Semidefinite programming and integer programming
- Semidefinite programming for discrete optimization and matrix completion problems
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for integer programming
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Solving certain singly constrained convex optimization problems in production planning
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Some NP-complete problems in quadratic and nonlinear programming
- Some simplified NP-complete graph problems
- Stronger linear programming relaxations of max-cut
- The algebraic degree of semidefinite programming
- The ellipsoid method and its consequences in combinatorial optimization
- The expected relative error of the polyhedral approximation of the max- cut problem
- The state-of-the-art in conic optimization software
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
Cited in
(8)- Complexity, exactness, and rationality in polynomial optimization
- Complexity, exactness, and rationality in polynomial optimization
- scientific article; zbMATH DE number 7743708 (Why is no real title available?)
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- Strict complementarity and non-degeneracy of solutions to copositive programming problems
- Non-exposed faces of the cone of completely positive matrices
- Properties of the complementarity set for the cone of copositive matrices
- The singularity degree of a face of the cone of copositive matrices
This page was built for publication: A guide to conic optimisation and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634309)
