Convex envelopes of separable functions over regions defined by separable functions of the same type

DOI10.1007/s11590-018-1291-5zbMath1410.90157OpenAlexW2810079190WikidataQ129576642 ScholiaQ129576642MaRDI QIDQ1634777

Marco Locatelli

Publication date: 18 December 2018

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

Full work available at URL: https://doi.org/10.1007/s11590-018-1291-5

zbMATH Keywords

quadratic programmingseparable functionsconvex envelopes

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Cites Work

• Unnamed Item
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
• Extended formulations for convex envelopes
• A clique algorithm for standard quadratic programming
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
• Deriving convex hulls through lifting and projection
• Convex envelopes for edge-concave functions
• Some results for quadratic problems with one or two quadratic constraints
• Explicit convex and concave envelopes through polyhedral subdivisions
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
• An Ellipsoidal Branch and Bound Algorithm for Global Optimization
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On Cones of Nonnegative Quadratic Functions

This page was built for publication: Convex envelopes of separable functions over regions defined by separable functions of the same type