An augmented Lagrangian decomposition method for block diagonal linear programming problems
From MaRDI portal
Recommendations
- Augmented Lagrangian method for large-scale linear programming problems
- Augmented Lagrangian algorithms for linear programming
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming
- A Decomposition Method Based On The Augmented Lagrangian
- On an augmented Lagrangian method for saddle-point linear systems with singular or semidefinite (1,1) blocks
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- An improved block modulus method for diagonally dominant linear complementarity problems
- Decomposition methods based on augmented Lagrangians: a survey
- On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
- Augmented Lagrangian methods for convex matrix optimization problems
Cites work
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A regularized decomposition method for minimizing a sum of polyhedral functions
- An extension of the frank and Wolfe method of feasible directions
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Decomposition in large system optimization using the method of multipliers
- Decomposition Principle for Linear Programs
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 140510 (Why is no real title available?)
- scientific article; zbMATH DE number 3571869 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Multiplier and gradient methods
- Parallel decomposition of multistage stochastic programming problems
- Restricted simplicial decomposition: Computation and extensions
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
Cited in
(20)- A diagonal quadratic approximation method for large scale linear programs
- Modelling and analysis of multistage stochastic programming problems: A software environment
- A smooth penalty function algorithm for network-structured problems
- Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
- KKT transformation approach for multi-objective multi-level linear programming problems
- Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems
- Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.
- Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming
- A decomposition procedure for one class of block programming problems
- scientific article; zbMATH DE number 4027166 (Why is no real title available?)
- A Decomposition Method Based On The Augmented Lagrangian
- Relaxation Method for Large Scale Linear Programming Using Decomposition
- scientific article; zbMATH DE number 140510 (Why is no real title available?)
- scientific article; zbMATH DE number 1513156 (Why is no real title available?)
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming
- Application of the linearization method to problems of large dimension
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming
- On the enrouting protocol problem under uncertainty
This page was built for publication: An augmented Lagrangian decomposition method for block diagonal linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314414)
