Iteration functions in some nonsmooth optimization algorithms
From MaRDI portal
Publication:1363553
zbMath0883.90111MaRDI QIDQ1363553
Publication date: 23 March 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for non-finite valued convex composite functions
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
- A trust region algorithm for minimization of locally Lipschitzian functions
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Piecewise Ck functions in nonsmooth analysis
- Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Optimization and nonsmooth analysis
- Descent methods for composite nondifferentiable optimization problems
- Submonotone Subdifferentials of Lipschitz Functions
- A global quadratic algorithm for solving a system of mixed equalities and inequalities
- A model algorithm for composite nondifferentiable optimization problems
- Minimization of Locally Lipschitzian Functions
- A Calculus of EPI-Derivatives Applicable to Optimization
- Iteration Functions in Some Nonsmooth Optimization Algorithms
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Convex Analysis
This page was built for publication: Iteration functions in some nonsmooth optimization algorithms