Conditions for convergence of trust region algorithms for nonsmooth optimization
From MaRDI portal
Recommendations
Cites work
- A model algorithm for composite nondifferentiable optimization problems
- A New Algorithm for Unconstrained Optimization
- scientific article; zbMATH DE number 3868525 (Why is no real title available?)
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 3912126 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3748332 (Why is no real title available?)
- scientific article; zbMATH DE number 3503002 (Why is no real title available?)
- On the global convergence of trust region algorithms for unconstrained minimization
- On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Cited in
(58)- Two error bounds for constrained optimization problems and their applications
- Experiments with successive quadratic programming algorithms
- A trust region algorithm for equality constrained optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A trust region algorithm for nonsmooth optimization
- A trust region method for minimization of nonsmooth functions with linear constraints
- Iteration functions in some nonsmooth optimization algorithms
- Trust region algorithm for nonsmooth optimization
- Quasi-Newton trust region algorithm for non-smooth least squares problems
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
- Smoothing trust region methods for nonlinear complementarity problems with P₀-functions
- An inexact algorithm for composite nondifferentiable optimization
- Nonmonotone trust region method for solving optimization problems
- Unification of basic and composite nondifferentiable optimization
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- Recent advances in trust region algorithms
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Value functions and error bounds of trust region methods
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Penalty methods with stochastic approximation for stochastic nonlinear programming
- A proximal method for composite minimization
- A new trust region method for nonsmooth nonconvex optimization
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- A trust region algorithm for solving bilevel programming problems
- scientific article; zbMATH DE number 1071787 (Why is no real title available?)
- A new trust region method for nonsmooth equations
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Computation of second-order directional stationary points for group sparse optimization
- Derivative-free optimization methods
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- Manifold sampling for _1 nonconvex optimization
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Efficiency of higher-order algorithms for minimizing composite functions
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- Local convergence analysis of an inexact trust-region method for nonsmooth optimization
- Constructing composite search directions with parameters in quadratic interpolation models
- Nonconvex nonsmooth multicomposite optimization and its applications to recurrent neural networks
- TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
- On detecting degenerate stationarity
- A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
- Smoothing methods for nonsmooth, nonconvex minimization
- A survey of trust-region radius update mechanisms. Part I: First-order analysis
- Mixed-integer linearity in nonlinear optimization: a trust region approach
- Canonical duality for solving nonconvex and nonsmooth optimization problem
- A new filter method for solving nonlinear complementarity problems
- Global convergence of a semi-infinite optimization method
This page was built for publication: Conditions for convergence of trust region algorithms for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696877)
