On conic QPCCs, conic QCQPs and completely positive programs
From MaRDI portal
Publication:312665
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)
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
Cites work
- scientific article; zbMATH DE number 3580262 (Why is no real title available?)
- scientific article; zbMATH DE number 1534298 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A class of quadratic programs with linear complementarity constraints
- A gentle, geometric introduction to copositive optimization
- A simple closure condition for the normal cone intersection formula
- A simple constraint qualification in infinite dimensional programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Algorithmic copositivity detection by simplicial partition
- An LPCC approach to nonconvex quadratic programs
- An adaptive linear approximation algorithm for copositive programs
- Approximation of the stability number of a graph via copositive programming
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- Convex analysis and nonlinear optimization. Theory and examples
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Copositive programming
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Existence of global minima for constrained optimization
- Existence of optimal solutions and duality results under weak conditions
- Factorization and cutting planes for completely positive matrices by copositive projection
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Nonconvex Structures in Nonlinear 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 Cones of Nonnegative Quadratic Functions
- On \(\ell_ p\) programming
- On convex quadratic programs with linear complementarity constraints
- On convex relaxations for quadratically constrained quadratic programming
- On copositive programming and standard quadratic optimization problems
- On extensions of the Frank-Wolfe theorems
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimal rank-sparsity decomposition
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Rank-Sparsity Incoherence for Matrix Decomposition
- Representing quadratically constrained quadratic programs as generalized copositive programs
- SDP relaxations for some combinatorial optimization problems
- Second-order cone programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Set intersection theorems and existence of optimal solutions
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Three modeling paradigms in mathematical programming
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Cited in
(27)- Convex hull results on quadratic programs with non-intersecting constraints
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Solving linear programs with complementarity constraints using branch-and-cut
- Conic approximation to quadratic optimization with linear complementarity constraints
- A penalty method for rank minimization problems in symmetric matrices
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- 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
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- scientific article; zbMATH DE number 6744339 (Why is no real title available?)
- Completely positive reformulations for polynomial optimization
- Completely positive reformulations of polynomial optimization problems with linear constraints
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- On Convex Hulls of Epigraphs of QCQPs
- 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
- Conic formulation of QPCCs applied to truly sparse QPs
- (Global) optimization: historical notes and recent developments
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
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)
