Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
From MaRDI portal
(Redirected from Publication:360523)
Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets''
Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets''
Recommendations
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Erratum to: higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Erratum to: ``On convex optimization without convex representation
- Erratum to: ``Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
- Erratum to: ``The existence of solutions for systems of generalized set-valued nonlinear quasi-variational inequalities
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Corrigendum: Convex Optimization Problems on Differentiable Sets
- Erratum to: A trust region method for solving semidefinite programs
Cites work
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- A note on Burer's copositive representation of mixed-binary QPs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Cited in
(18)- A short note on strongly convex programming for exact matrix completion and robust principal component analysis
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Erratum to: ``On the Aubin property of critical points to perturbed second-order cone programs
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Moment approximations for set-semidefinite polynomials
- On conic QPCCs, conic QCQPs and completely positive programs
- Comments on ``On the indefinite quadratic fractional optimization with two quadratic constraints
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Completely positive reformulations for polynomial optimization
- Convex hull results on quadratic programs with non-intersecting constraints
- Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Remarks on solutions to a nonconvex quadratic programming test problem
This page was built for publication: Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360523)
