The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization

DOI10.1007/BF00933339zbMATH Open0278.49040OpenAlexW2033648544MaRDI QIDQ1842902FDOQ1842902

Authors: Yanyan Li 

Publication date: 1975

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933339

Mathematics Subject Classification ID

Mathematical programming (90C99) Numerical methods in optimal control (49M99)

Cites Work

• An Algorithm for Separable Nonconvex Programming Problems
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Extensions of Lagrange Multipliers in Nonlinear Programming
• Title not available (Why is that?)
• Generalized Penalty-Function Concepts in Mathematical Optimization
• On a new functional transform in analysis: The maximum transform
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
• A New Foundation for a Simplified Primal Integer Programming Algorithm
• Technical Note—Bounding Nonconvex Programs by Conjugates

Cited In (41)

• New dual-type decomposition algorithm for non-convex separable optimization problems
• Separable approximations and decomposition methods for the augmented Lagrangian
• Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
• Title not available (Why is that?)
• Double-loop-iterative-tracking-algorithm-based direct coordination for hierarchical steady-state control of interconnected systems
• Applications of the method of partial inverses to convex programming: Decomposition
• Decomposition for structured convex programs with smooth multiplier methods
• A proximal-based deomposition method for compositions method for convex minimization problems
• Modified Lagrangian methods for separable optimization problems
• The decomposition optimization of complex systems
• Decomposition methods in stochastic programming
• Analysis of the alternating direction method of multipliers for nonconvex problems
• Tracking approach in hierarchical optimization of large-scale systems
• Reply to “ Comments on ‘ Extension of dual coordination to a class of non-linear systems ’ ”
• A diagonal quadratic approximation method for large scale linear programs
• A variable-penalty alternating directions method for convex optimization
• Reduction of indefinite quadratic programs to bilinear programs
• A survey on operator splitting and decomposition of convex programs
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• An augmented Lagrangian based algorithm for distributed nonconvex optimization
• A Hierarchical approach to optimized control of water distribution systems: Part II. Lower-level algorithm
• A branch-and-reduce approach to global optimization
• The decentralized profit maximization of interconnected production systems Part II. Price coordination and buffer storage
• New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
• Network planning under uncertainty with an application to hydropower generation
• Solutions of nonlinear optimal regulator and \(H_ \infty\) control problems via Galerkin methods
• On augmented Lagrangian decomposition methods for multistage stochastic programs
• An augmented Lagrangian method for distributed optimization
• Globally convergent decomposition methods for nonconvex optimization problems
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
• Augmented model-based double iterative loop techniques for hierarchical control of complex industrial processes
• Exact augmented lagrangian approach to multilevel optimization of large-scale systems
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Convexification and decomposition of separable nonconvex optimization problems
• Decomposition in large system optimization using the method of multipliers
• Decomposition methods based on augmented Lagrangians: a survey
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
• An infeasible method of large-system optimization by direct coordination of subsystem inputs
• Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
• Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization

This page was built for publication: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization

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