A model algorithm for composite nondifferentiable optimization problems
From MaRDI portal
Cited in
(61)- The Sequential Quadratic Programming Method
- A new trust region method for nonsmooth nonconvex optimization
- Variational analysis of a nonconvex and nonsmooth optimization problem: an introduction
- An algorithm for composite nonsmooth optimization problems
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Descent methods for composite nondifferentiable optimization problems
- Second order necessary and sufficient conditions for convex composite NDO
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- A robust sequential quadratic programming method
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Superlinearly convergent algorithm for min-max problems
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- scientific article; zbMATH DE number 1062863 (Why is no real title available?)
- Efficiency of higher-order algorithms for minimizing composite functions
- A trust region algorithm for nonsmooth optimization
- Discontinuous piecewise linear optimization
- Algorithms with adaptive smoothing for finite minimax problems
- Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- A nonmonotonic hybrid algorithm for min-max problem
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Nonmonotone trust region method for solving optimization problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Corrected sequential linear programming for sparse minimax optimization
- An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
- Use of exact penalty functions to determine efficient decisions
- Descent algorithm for a class of convex nondifferentiable functions
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Manifold sampling for _1 nonconvex optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Accelerated first-order optimization under nonlinear constraints
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Convex composite multi-objective nonsmooth programming
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- A new technique for inconsistent QP problems in the SQP method
- Recent advances in trust region algorithms
- Consistent approximations in composite optimization
- A smooth method for the finite minimax problem
- A projected conjugate gradient method for sparse minimax problems
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- The multiproximal linearization method for convex composite problems
- Iteration functions in some nonsmooth optimization algorithms
- Relax-and-split method for nonconvex inverse problems
- An iterative working-set method for large-scale nonconvex quadratic programming
- Nonmonotone algorithm for minimax optimization problems
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
- A coordinate gradient descent method for nonsmooth separable minimization
This page was built for publication: A model algorithm for composite nondifferentiable optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936513)
