Globally convergent decomposition methods for nonconvex optimization problems
From MaRDI portal
Publication:787645
Cites work
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3533576 (Why is no real title available?)
- scientific article; zbMATH DE number 3624709 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Foundations of optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Multiplier and gradient methods
- Optimization strategies for hydro energy storage plants
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
Cited in
(5)- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Optimization of hydro energy storage plant problems by variational methods
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
- Optimization strategies for hydro energy storage plants
- On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems
This page was built for publication: Globally convergent decomposition methods for nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787645)
