scientific article; zbMATH DE number 3868525
From MaRDI portal
Publication:3334896
zbMATH Open0545.65047MaRDI QIDQ3334896FDOQ3334896
Authors: M. J. D. Powell
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
line searchdescent methodsfunctional minimizationdiscrete nonlinear approximationsuperlinear rate of convergencetrust region techniques
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cited In (24)
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A new trust region method for nonsmooth nonconvex optimization
- ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS*
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- A Gauss-Newton method for convex composite optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Title not available (Why is that?)
- Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control
- Consistent approximations in composite optimization
- Recent advances in trust region algorithms
- Title not available (Why is that?)
- Relax-and-split method for nonconvex inverse problems
- Title not available (Why is that?)
- A global convergent derivative-free method for solving a system of non-linear equations
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
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)