A gradient projection-multiplier method for nonlinear programming
From MaRDI portal
Publication:1235642
DOI10.1007/BF00935298zbMath0351.90066OpenAlexW2048871643MaRDI QIDQ1235642
Publication date: 1978
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00935298
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Parallel algorithms for nonlinear programming problems ⋮ A class of generalized variable penalty methods for nonlinear programming ⋮ Variable penalty methods for constrained minimization ⋮ Space-decomposition multiplier method for constrained minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the nonlinear least square problem: Application of a general method
- An accelerated multiplier method for nonlinear programming
- An improved penalty function method for solving constrained parameter optimization problems
- Optimal three-burn orbit transfer
- A Rapidly Convergent Descent Method for Minimization
- An evaluation of linear least squares computer programs
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
This page was built for publication: A gradient projection-multiplier method for nonlinear programming
