Constrained optimization with normed moving truncations penalty-functions
From MaRDI portal
The normed moving truncations penalty-function method differs from the common exterior moving truncations penalty function method in that the problem functions are normalized after every completed unconstrained optimization, by multiplying with the reciprocal values attained by the functions. Computational results on 12 problems of varying complexity are reported, and compared with the results achieved by two other penalty-function methods.
Recommendations
Cites work
- A new approach to variable metric algorithms
- scientific article; zbMATH DE number 3347920 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- scientific article; zbMATH DE number 3383729 (Why is no real title available?)
- Parameter Selection for Modified Newton Methods for Function Minimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
This page was built for publication: Constrained optimization with normed moving truncations penalty-functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134630)