Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets

DOI10.1007/S11590-013-0645-2zbMATH Open1298.90063OpenAlexW2158226611MaRDI QIDQ360523FDOQ360523

Authors: Peter J. C. Dickinson, Gabriele Eichfelder, Janez Povh 

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0645-2

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

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)

Cites Work

• Title not available (Why is that?)
• On the copositive representation of binary and continuous nonconvex quadratic programs
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• A note on Burer's copositive representation of mixed-binary QPs

Cited In (18)

• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Remarks on solutions to a nonconvex quadratic programming test problem
• Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• On conic QPCCs, conic QCQPs and completely positive programs
• Erratum to: ``On the Aubin property of critical points to perturbed second-order cone programs
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• Completely positive reformulations for polynomial optimization
• Comments on ``On the indefinite quadratic fractional optimization with two quadratic constraints
• A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
• A short note on strongly convex programming for exact matrix completion and robust principal component analysis
• Moment approximations for set-semidefinite polynomials
• Convex hull results on quadratic programs with non-intersecting constraints
• Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

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)