The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
From MaRDI portal
Publication:1842902
Cites work
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A New Foundation for a Simplified Primal Integer Programming Algorithm
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Generalized Penalty-Function Concepts in Mathematical Optimization
- On a new functional transform in analysis: The maximum transform
- Technical Note—Bounding Nonconvex Programs by Conjugates
Cited in
(41)- A Hierarchical approach to optimized control of water distribution systems: Part II. Lower-level algorithm
- Reduction of indefinite quadratic programs to bilinear programs
- Separable approximations and decomposition methods for the augmented Lagrangian
- A variable-penalty alternating directions method for convex optimization
- An augmented Lagrangian method for distributed optimization
- An infeasible method of large-system optimization by direct coordination of subsystem inputs
- Decomposition in large system optimization using the method of multipliers
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Decomposition methods based on augmented Lagrangians: a survey
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
- Analysis of the alternating direction method of multipliers for nonconvex problems
- A branch-and-reduce approach to global optimization
- Modified Lagrangian methods for separable optimization problems
- Decomposition for structured convex programs with smooth multiplier methods
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
- Reply to “ Comments on ‘ Extension of dual coordination to a class of non-linear systems ’ ”
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Globally convergent decomposition methods for nonconvex optimization problems
- Exact augmented lagrangian approach to multilevel optimization of large-scale systems
- Convexification and decomposition of separable nonconvex optimization problems
- A diagonal quadratic approximation method for large scale linear programs
- Tracking approach in hierarchical optimization of large-scale systems
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- scientific article; zbMATH DE number 4027262 (Why is no real title available?)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Decomposition methods in stochastic programming
- Network planning under uncertainty with an application to hydropower generation
- The decentralized profit maximization of interconnected production systems Part II. Price coordination and buffer storage
- Solutions of nonlinear optimal regulator and \(H_ \infty\) control problems via Galerkin methods
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- A survey on operator splitting and decomposition of convex programs
- New dual-type decomposition algorithm for non-convex separable optimization problems
- 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
- Double-loop-iterative-tracking-algorithm-based direct coordination for hierarchical steady-state control of interconnected systems
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- The decomposition optimization of complex systems
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- Applications of the method of partial inverses to convex programming: Decomposition
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)
