Eigenvalue techniques for convex objective, nonconvex optimization problems
From MaRDI portal
Recommendations
- Enumerative techniques for solving some nonconvex global optimization problems
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A general system for heuristic minimization of convex functions over non-convex sets
- On nonconvex quadratic programming with box constraints
- scientific article; zbMATH DE number 1560353
Cited in
(12)- A semidefinite programming method for integer convex quadratic minimization
- On convex quadratic programs with linear complementarity constraints
- Ellipsoid bounds for convex quadratic integer programming
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- Fitting piecewise linear continuous functions
- A general system for heuristic minimization of convex functions over non-convex sets
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Convexification with bounded gap for randomly projected quadratic optimization
- A Scalable Algorithm for Sparse Portfolio Selection
- Nonlinear eigenvector methods for convex minimization over the numerical range
- scientific article; zbMATH DE number 7313894 (Why is no real title available?)
- A new perspective on low-rank optimization
This page was built for publication: Eigenvalue techniques for convex objective, nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569806)
