Descent heuristics for unconstrained minimization
Abstract: Semidefinite relaxations often provide excellent starting points for nonconvex problems with multiple local minimizers. This work aims to find a local minimizer within a certain neighborhood of the starting point and with a small objective value. Several approaches are motivated and compared with each other.
Keywords: Descent method, unconstrained minimization, local minimizer
Category 1: Global Optimization (Other )
Category 2: Nonlinear Optimization (Unconstrained Optimization )
Citation: Report, Mathematisches Institut, Universitaet Duesseldorf, August 2008.
Entry Submitted: 08/14/2008
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|