On conic QPCCs, conic QCQPs and completely positive programs
From MaRDI portal
Publication:312665
DOI10.1007/S10107-015-0951-9zbMATH Open1346.90624OpenAlexW2180827833MaRDI QIDQ312665FDOQ312665
Authors: Lijie Bai, John E. Mitchell, Jong-Shi Pang 
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
Recommendations
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Solving conic quadratically constrained quadratic programming problems
- Conic approximation to quadratic optimization with linear complementarity constraints
- Conic formulation of QPCCs applied to truly sparse QPs
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Rank-Sparsity Incoherence for Matrix Decomposition
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Second-order cone programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- An adaptive linear approximation algorithm for copositive programs
- On Cones of Nonnegative Quadratic Functions
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Mathematical Programs with Equilibrium Constraints
- Three modeling paradigms in mathematical programming
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Convex analysis and nonlinear optimization. Theory and examples
- A Frank--Wolfe type theorem for convex polynomial programs
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Factorization and cutting planes for completely positive matrices by copositive projection
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the computational complexity of membership problems for the completely positive cone and its dual
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- SDP relaxations for some combinatorial optimization problems
- On \(\ell_ p\) programming
- On extensions of the Frank-Wolfe theorems
- Existence of optimal solutions and duality results under weak conditions
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On convex relaxations for quadratically constrained quadratic programming
- A gentle, geometric introduction to copositive optimization
- On convex quadratic programs with linear complementarity constraints
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Algorithmic copositivity detection by simplicial partition
- Copositive programming
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- 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
- Title not available (Why is that?)
- An LPCC approach to nonconvex quadratic programs
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Title not available (Why is that?)
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- A simple closure condition for the normal cone intersection formula
- Optimal rank-sparsity decomposition
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- On copositive programming and standard quadratic optimization problems
- A class of quadratic programs with linear complementarity constraints
- Existence of global minima for constrained optimization
- Set intersection theorems and existence of optimal solutions
Cited In (27)
- Solving linear programs with complementarity constraints using branch-and-cut
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Conic approximation to quadratic optimization with linear complementarity constraints
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- A penalty method for rank minimization problems in symmetric matrices
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Completely positive and copositive program modelling for quadratic optimization problems
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Generalizations of doubly nonnegative cones and their comparison
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- Computing B-stationary points of nonsmooth DC programs
- Title not available (Why is that?)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- Completely positive reformulations for polynomial optimization
- Completely positive reformulations of polynomial optimization problems with linear constraints
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- On Convex Hulls of Epigraphs of QCQPs
- 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
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- (Global) optimization: historical notes and recent developments
- Conic formulation of QPCCs applied to truly sparse QPs
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Convex hull results on quadratic programs with non-intersecting constraints
Uses Software
This page was built for publication: On conic QPCCs, conic QCQPs and completely positive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312665)
