Globally convergent decomposition methods for nonconvex optimization problems

DOI10.1007/BF02243573zbMath0529.65036MaRDI QIDQ787645

Helmut Gfrerer

Publication date: 1984

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

decomposition methodsprimal-dual methodsconvexification procedureshydroenergy power station

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items

New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization ⋮ On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems ⋮ Optimization strategies for hydro energy storage plants ⋮ Optimization of hydro energy storage plant problems by variational methods ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• Foundations of optimization
• Convexification procedures and decomposition methods for nonconvex optimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Multiplier and gradient methods
• Optimization strategies for hydro energy storage plants
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item