On conic QPCCs, conic QCQPs and completely positive programs
From MaRDI portal
Publication:312665
DOI10.1007/s10107-015-0951-9zbMath1346.90624OpenAlexW2180827833MaRDI QIDQ312665
John E. Mitchell, Jong-Shi Pang, Lijie Bai
Publication date: 16 September 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0951-9
Semidefinite programming (90C22) Convex programming (90C25) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A penalty method for rank minimization problems in symmetric matrices, Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Applying ranking and selection procedures to long-term mitigation for improved network restoration, Conic approximation to quadratic optimization with linear complementarity constraints, An exact completely positive programming formulation for the discrete ordered median problem: an extended version, Completely positive reformulations of polynomial optimization problems with linear constraints, (Global) optimization: historical notes and recent developments, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Approximation hierarchies for copositive cone over symmetric cone and their comparison, Convex hull results on quadratic programs with non-intersecting constraints, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Conic formulation of QPCCs applied to truly sparse QPs, Computing B-Stationary Points of Nonsmooth DC Programs, Completely positive and copositive program modelling for quadratic optimization problems, Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, Solving linear programs with complementarity constraints using branch-and-cut, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, Completely positive reformulations for polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- An LPCC approach to nonconvex quadratic programs
- Representing quadratically constrained quadratic programs as generalized copositive programs
- On the computational complexity of membership problems for the completely positive cone and its dual
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Optimal rank-sparsity decomposition
- Three modeling paradigms in mathematical programming
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A class of quadratic programs with linear complementarity constraints
- Existence of global minima for constrained optimization
- Set intersection theorems and existence of optimal solutions
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- On \(\ell_ p\) programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- On extensions of the Frank-Wolfe theorems
- Second-order cone programming
- Convex analysis and nonlinear optimization. Theory and examples
- Existence of optimal solutions and duality results under weak conditions
- A Frank--Wolfe type theorem for convex polynomial programs
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On convex relaxations for quadratically constrained quadratic programming
- A gentle, geometric introduction to copositive optimization
- On convex quadratic programs with linear complementarity constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Algorithmic copositivity detection by simplicial partition
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Approximation of the Stability Number of a Graph via Copositive Programming
- Copositive Programming
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
- SDP Relaxations for Some Combinatorial Optimization Problems
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Rank-Sparsity Incoherence for Matrix Decomposition
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Nonconvex Structures in Nonlinear Programming
- A simple constraint qualification in infinite dimensional programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A simple closure condition for the normal cone intersection formula
- Adaptive computable approximation to cones of nonnegative quadratic functions
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- On Cones of Nonnegative Quadratic Functions
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Mathematical Programs with Equilibrium Constraints
- On copositive programming and standard quadratic optimization problems
