scientific article; zbMATH DE number 3868525

MaRDI QIDQ3334896zbMATH OpenFDO

Authors M. J. D. Powell

Publication date 1983

zbMATH Keywords

line searchdescent methodsfunctional minimizationdiscrete nonlinear approximationsuperlinear rate of convergencetrust region techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3994940
• ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS^*
• A direct method of linearization for continuous minimax problems
• scientific article; zbMATH DE number 3997045
• scientific article; zbMATH DE number 774949

Cited in

(24)

• Efficiency of minimizing compositions of convex functions and smooth maps
• Error bounds, quadratic growth, and linear convergence of proximal methods
• Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control
• A Gauss-Newton method for convex composite optimization
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
• scientific article; zbMATH DE number 3967806 (Why is no real title available?)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
• Consistent approximations in composite optimization
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
• Recent advances in trust region algorithms
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• scientific article; zbMATH DE number 3994940 (Why is no real title available?)
• A unified approach to global convergence of trust region methods for nonsmooth optimization
• Nonsmooth bundle trust-region algorithm with applications to robust stability
• ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS^*
• A global convergent derivative-free method for solving a system of non-linear equations
• Relax-and-split method for nonconvex inverse problems
• A new trust region method for nonsmooth nonconvex optimization
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
• scientific article; zbMATH DE number 4048904 (Why is no real title available?)
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
• Algorithms for the Generalized NTRU Equations and their Storage Analysis
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
• A derivative-free trust-region algorithm for composite nonsmooth optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334896)