Conic formulation of QPCCs applied to truly sparse QPs (Q2696922)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Conic formulation of QPCCs applied to truly sparse QPs

scientific article; zbMATH DE number 7675377

Language	Label	Description	Also known as
default for all languages	No label defined
English	Conic formulation of QPCCs applied to truly sparse QPs	scientific article; zbMATH DE number 7675377

Statements

instance of

scholarly article

0 references

title

Conic formulation of QPCCs applied to truly sparse QPs (English)

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

17 April 2023

0 references

zbMATH Keywords

copositive optimization

0 references

conic relaxation

0 references

quadratic optimization

0 references

sparsity

0 references

complementarity constraints

0 references

describes a project that uses

MacMPEC

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10589-022-00440-5

0 references

cites work

Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming

0 references

Testing copositivity via mixed-integer linear programming

0 references

On conic QPCCs, conic QCQPs and completely positive programs

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

On handling indicator constraints in mixed integer programming

0 references

A Scalable Algorithm for Sparse Portfolio Selection

0 references

Q5054600

0 references

Copositive optimization -- recent developments and applications

0 references

Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems

0 references

On copositive programming and standard quadratic optimization problems

0 references

Copositivity detection by difference-of-convex decomposition and $\omega $-subdivision

0 references

Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization

0 references

Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

A gentle, geometric introduction to copositive optimization

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Cuts for mixed 0-1 conic programming

0 references

Sparse solutions of linear complementarity problems

0 references

Mixed-integer quadratic programming is in NP

0 references

Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming

0 references

On integer and MPCC representability of affine sparsity

0 references

Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems

0 references

Complementarity formulations of $\ell_0$-norm optimization

0 references

A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints

0 references

DC formulations and algorithms for sparse optimization problems

0 references

Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation

0 references

A variational approach to copositive matrices

0 references

A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

0 references

Trust-region methods for the derivative-free optimization of nonsmooth black-box functions

0 references

Fast L1-L2 minimization via a proximal operator

0 references

Mathematical Programs with Equilibrium Constraints

0 references

Tractable ADMM schemes for computing KKT points and local minimizers for $\ell_0$-minimization problems

0 references

Minimization of $\ell_{1-2}$ for compressed sensing

0 references

<formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm

0 references

Conic approximation to quadratic optimization with linear complementarity constraints

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10589-022-00440-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Conic formulation of QPCCs applied to truly sparse QPs