Globally convergent decomposition methods for nonconvex optimization problems

DOI10.1007/BF02243573zbMATH Open0529.65036MaRDI QIDQ787645FDOQ787645

Authors: 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)

Cites Work

• Multiplier and gradient methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Title not available (Why is that?)
• Foundations of optimization
• Title not available (Why is that?)
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Optimization strategies for hydro energy storage plants

Cited In (5)

• Optimization strategies for hydro energy storage plants
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• 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 of hydro energy storage plant problems by variational methods

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)