A parameter-free multiplier method for constrained minimization problems
This paper is concerned with the development of a nonlinear programming method closely related to the augmented Lagrangian methods. The method is obtained by a combination of methods of steepest descent and differential trajectory types. A computational algorithm is presented and its application is illustrated by means of two-dimensional examples. The convergence of the algorithm for the general case is not investigated. Reviewer's remark: Similar results were obtained by \textit{Yu. G. Evtushenko} [Methods for solving extremal problems and their application in systems of optimization (1982; Zbl 0523.49002)].
- scientific article; zbMATH DE number 3963580
- scientific article; zbMATH DE number 4074828
- Una nota sul metodo dei moltiplicatori
- Multiplier and gradient methods
- A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize
- A parametric successive underestimation method for convex multiplicative programming problems
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- scientific article; zbMATH DE number 4130194 (Why is no real title available?)
- scientific article; zbMATH DE number 3963580 (Why is no real title available?)
- scientific article; zbMATH DE number 4074828 (Why is no real title available?)
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
This page was built for publication: A parameter-free multiplier method for constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107278)