The following pages link to (Q3334896):
Displaying 16 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control (Q1321390) (← links)
- A unified approach to global convergence of trust region methods for nonsmooth optimization (Q1890930) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- A global convergent derivative-free method for solving a system of non-linear equations (Q2408152) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)
