On Iterated Minimization in Nonconvex Optimization

DOI10.1287/MOOR.11.4.679MaRDI QIDQ3030596zbMATH OpenOpenAlexFDO

Authors Hubertus T. Jongen, T. Möbert, Klaus Tammer

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/on-iterated-minimization-in-nonconvex-optimization(37744bea-7ba9-4889-a0fd-c85eccf65664).html

zbMATH Keywords

decompositionnonconvex programmingstationary and local solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• scientific article; zbMATH DE number 16990
• On a local and global search involved in nonconvex optimization problems
• Some convergence theorems on nonstationary minimization processes¹
• The solution of discrete minimax problems
• Minmaxmin problems revisited

Cited in

(16)

• On inertia and Schur complement in optimization
• An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization
• Two-level optimization with approximate solutions in the lower level
• On second-order Taylor expansion of critical values
• scientific article; zbMATH DE number 220318 (Why is no real title available?)
• On the differentiability of optimal values for bounded nonlinear programs with equality constraints
• On second-order sufficient optimality conditions for c ^1,1-optimization problems
• Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization
• Slopes of shadow prices and Lagrange multipliers
• Implicit functions and sensitivity of stationary points
• Partly convex programming and Zermelo's navigation problems
• Stable parametric programming^*
• On parametric nonlinear programming
• Structural stability in nonlinear optimization
• Karush-Kuhn-Tucker conditions in set optimization
• scientific article; zbMATH DE number 16990 (Why is no real title available?)

This page was built for publication: On Iterated Minimization in Nonconvex Optimization

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