On the superlinear convergence of a trust region algorithm for nonsmooth optimization
From MaRDI portal
(Redirected from Publication:3698656)
Recommendations
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- scientific article; zbMATH DE number 1282016
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations
- scientific article; zbMATH DE number 810434
Cites work
- A model algorithm for composite nondifferentiable optimization problems
- A New Algorithm for Unconstrained Optimization
- A numerically stable dual method for solving strictly convex quadratic programs
- A Projected Lagrangian Algorithm for Nonlinear l₁ Optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- scientific article; zbMATH DE number 3912118 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3503002 (Why is no real title available?)
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
- Newton-type methods for unconstrained and linearly constrained optimization
- Numerically stable methods for quadratic programming
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
Cited in
(47)- Two error bounds for constrained optimization problems and their applications
- Superlinear convergence of a trust region type successive linear programming method
- A trust region algorithm for nonsmooth optimization
- On the numerical treatment of nonconvex energy problems: Multilevel decomposition methods for hemivariational inequalities.
- Smoothing trust region methods for nonlinear complementarity problems with P₀-functions
- A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
- An inexact algorithm for composite nondifferentiable optimization
- Unification of basic and composite nondifferentiable optimization
- An active-set algorithm and a trust-region approach in constrained minimax problem
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- A hybrid algorithm for nonlinear minimax problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Recent advances in trust region algorithms
- A nonmonotonic hybrid algorithm for min-max problem
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- Value functions and error bounds of trust region methods
- A trust region SQP algorithm for mixed-integer nonlinear programming
- A feasible trust-region algorithm for inequality constrained optimization
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- A proximal method for composite minimization
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Training multi-layered neural network with a trust-region based algorithm
- A hybrid algorithm for linearly constrained minimax problems
- scientific article; zbMATH DE number 1329077 (Why is no real title available?)
- scientific article; zbMATH DE number 1942631 (Why is no real title available?)
- A new trust region method for nonsmooth equations
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- A study of convex convex-composite functions via infimal convolution with applications
- Relax-and-split method for nonconvex inverse problems
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Trust-region interior-point method for large sparsel1optimization
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Algorithms with adaptive smoothing for finite minimax problems
- Consistent approximations in composite optimization
- Nonmonotone algorithm for minimax optimization problems
- Constructing composite search directions with parameters in quadratic interpolation models
- A smooth method for the finite minimax problem
- TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
- Variational analysis of a nonconvex and nonsmooth optimization problem: an introduction
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations
- A new filter method for solving nonlinear complementarity problems
This page was built for publication: On the superlinear convergence of a trust region algorithm for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698656)
