On Iterated Minimization in Nonconvex Optimization
DOI10.1287/MOOR.11.4.679zbMATH Open0626.90080OpenAlexW1980145057MaRDI QIDQ3030596FDOQ3030596
Klaus Tammer, Hubertus T. Jongen, T. Möbert
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (16)
- Title not available (Why is that?)
- Karush-Kuhn-Tucker conditions in set optimization
- On parametric nonlinear programming
- An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization
- Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization
- Partly convex programming and Zermelo's navigation problems
- Implicit functions and sensitivity of stationary points
- Stable parametric programming*
- Title not available (Why is that?)
- Two-level optimization with approximate solutions in the lower level
- On the differentiability of optimal values for bounded nonlinear programs with equality constraints
- On inertia and Schur complement in optimization
- Title not available (Why is that?)
- Structural stability in nonlinear optimization
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Slopes of shadow prices and Lagrange multipliers
Recommendations
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)
