Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
From MaRDI portal
Publication:2420821
DOI10.1007/s10957-019-01488-wzbMath1415.90120MaRDI QIDQ2420821
Nobuo Yamashita, Tomohiro Niimi, Siti Nor Habibah Binti Hassan
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01488-w
nonlinear optimization; gradient descent method; large-scale problem; augmented Lagrangian functions
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A tabu search heuristic procedure for the fixed charge transportation problem
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Multiplier and gradient methods
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item