An inexact algorithm for composite nondifferentiable optimization
The paper presents an inexact version of Fletcher's trust-region algorithm with second-order corrections for minimizing composite non- smooth functions. The composite non-smooth optimization problem is: \(\min \{f(x)+h(c(x))\}\), where f and c are twice continuously differentiable and h is a polyhedral convex function of the form \(h(c)=\max h^ T_ ic+b_ i.\) This paper modifies the second-order correction method of \textit{R. Fletcher} [Numerical analysis, Proc. 9th Bienn. Conf., Dundee/Scotl. 1981, Lect. Notes Math. 912, 85-114 (1982; Zbl 0476.65048)] to allow inexactness in the solution of the subproblem at each iteration. The modified algorithm is shown to retain the global and local convergence properties of the original method under certain conditions.
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- A trust region algorithm for nonsmooth optimization
- Trust region algorithm for nonsmooth optimization
- scientific article; zbMATH DE number 1180444
- A nonmonotonic trust region method for composite nonsmooth optimization problems
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- Concise representation of generalised gradients
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3748332 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Inexact Newton Methods
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Local properties of algorithms for minimizing nonsmooth composite functions
- Local properties of inexact methods for minimizing nonsmooth composite functions
- On the Identification of Active Constraints
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Optimization and nonsmooth analysis
- Second order necessary and sufficient conditions for convex composite NDO
- An algorithm for nondifferentiable optimization
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Unification of basic and composite nondifferentiable optimization
- Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\)
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- Local properties of inexact methods for minimizing nonsmooth composite functions
- scientific article; zbMATH DE number 653038 (Why is no real title available?)
- A trust region algorithm for constrained optimization
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
This page was built for publication: An inexact algorithm for composite nondifferentiable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823153)
