High-order Newton-penalty algorithms
From MaRDI portal
Publication:557745
Recommendations
Cites work
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Augmented penalty algorithms
- Global convergence technique for the Newton method with periodic Hessian evaluation
- Numerical Stability and Efficiency of Penalty Algorithms
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- On the superlinear convergence order of the logarithmic barrier algorithm
Cited in
(7)- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Fast unconditionally stable 2-D analysis of non-conjugate gear contacts using an explicit formulation of the meshing equations
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Implementation issues for high-order algorithms
- La différentiation automatique et son utilisation en optimisation
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Direct analytical solution of a modified form of the meshing equations in two dimensions for non-conjugate gear contact
This page was built for publication: High-order Newton-penalty algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557745)