A guide to conic optimisation and its applications
From MaRDI portal
Publication:4634309
DOI10.1051/ro/2018034zbMath1411.90256OpenAlexW2799712320MaRDI QIDQ4634309
Andrew J. Parkes, Adam N. Letchford
Publication date: 7 May 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/124943/1/conic_guide.pdf
Related Items
Unnamed Item, Complexity, exactness, and rationality in polynomial optimization, Complexity, exactness, and rationality in polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- Interior point methods 25 years later
- Complexity results for the gap inequalities for the max-cut problem
- Relative entropy optimization and its applications
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Handbook on semidefinite, conic and polynomial optimization
- Combinatorial properties and the complexity of a max-cut approximation
- Semidefinite programming for discrete optimization and matrix completion problems
- Conic formulation for \(l_p\)-norm optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- The algebraic degree of semidefinite programming
- A boundary point method to solve semidefinite programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Applications of second-order cone programming
- The ellipsoid method and its consequences in combinatorial optimization
- Solving certain singly constrained convex optimization problems in production planning
- Dual quadratic estimates in polynomial and Boolean programming
- Geometric algorithms and combinatorial optimization
- Some simplified NP-complete graph problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Robust solutions of uncertain linear programs
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming in combinatorial optimization
- Complementarity and nondegeneracy in semidefinite programming
- An exact duality theory for semidefinite programming and its complexity implications
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- Stronger linear programming relaxations of max-cut
- Second-order cone programming
- Semidefinite programming relaxations for semialgebraic problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Semidefinite programming
- Interior point methods for second-order cone programming and OR applications
- The expected relative error of the polyhedral approximation of the max- cut problem
- On a positive semidefinite relaxation of the cut polytope
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Gap inequalities for the cut polytope
- On convex relaxations for quadratically constrained quadratic programming
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Local minima and convergence in low-rank semidefinite programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- Global Optimization with Polynomials and the Problem of Moments
- Copositive Programming
- The State-of-the-Art in Conic Optimization Software
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Semidefinite optimization
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
- On Nonconvex Quadratic Programming with Box Constraints
- Semidefinite Relaxations for Integer Programming
- Some NP-complete problems in quadratic and nonlinear programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- Semidefinite Programming
- Fixing Variables in Semidefinite Relaxations
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- On the facial structure of set packing polyhedra
- Regularization Methods for Semidefinite Programming
- Euclidean Distance Geometry and Applications
- On Polyhedral Approximations of the Second-Order Cone
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Geometry of cuts and metrics
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Introduction to global optimization.
- Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
