Some properties of solution sets to nonconvex quadratic programming problems

DOI10.1080/02331930600819597zbMATH Open1135.90375OpenAlexW2081578574MaRDI QIDQ5423641FDOQ5423641

Authors: Hoang Xuan Phu 

Publication date: 31 October 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930600819597

Recommendations

• On nonconvex quadratic programming with box constraints
• Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
• scientific article; zbMATH DE number 3866053
• A simple characterization of solutions sets of convex programs
• scientific article; zbMATH DE number 3936940

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Logarithmic order of free distributive lattice
• Properties of the general quadratic optimization problem and the corresponding linear complementarity problem

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global infimum of strictly convex quadratic functions with bounded perturbations
• Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
• Maximizing strictly convex quadratic functions with bounded perturbations

This page was built for publication: Some properties of solution sets to nonconvex quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5423641)