Algorithms for structured nonconvex optimization: theory and practice

MaRDI QIDQ4611019zbMATH OpenFDO

Authors Nguyen H. Thao

Publication date 23 January 2019

Full work available at URL http://d-nb.info/1163451428/34, http://hdl.handle.net/11858/00-1735-0000-002E-E45C-6

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
• Fixed point algorithms for nonconvex feasibility with applications
• A convergent relaxation of the Douglas-Rachford algorithm
• Local linear convergence for alternating and averaged nonconvex projections

Cited in

(5)

• Fixed point algorithms for nonconvex feasibility with applications
• On Algorithms for Nonconvex Optimization in the Calculus of Variations
• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• Local linear convergence of approximate projections onto regularized sets
• Algorithms for construction of efficient frontier for nonconvex models on the basis of optimization methods

This page was built for publication: Algorithms for structured nonconvex optimization: theory and practice

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