Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
From MaRDI portal
Publication:3569806
DOI10.1007/978-3-642-13036-6_3zbMath1285.90038OpenAlexW1572739191MaRDI QIDQ3569806
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_3
Related Items (7)
On convex quadratic programs with linear complementarity constraints ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ A new perspective on low-rank optimization ⋮ Ellipsoid Bounds for Convex Quadratic Integer Programming ⋮ Fitting piecewise linear continuous functions ⋮ A semidefinite programming method for integer convex quadratic minimization
Uses Software
This page was built for publication: Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
