A trust region method for minimization of nonsmooth functions with linear constraints
From MaRDI portal
Publication:1356054
DOI10.1007/BF02614392zbMath0871.90088MaRDI QIDQ1356054
José Mario Martínez, Antonio Carlos Moretti
Publication date: 9 October 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global convergenceparameter estimationlinear constraintstrust region algorithmminimization of nonsmooth functions
Related Items
A trust region method for solving linearly constrained locally Lipschitz optimization problems, A new filter method for solving nonlinear complementarity problems, A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization, The approximation algorithm for solving a sort of non-smooth programming, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions, The chain rule for VU-decompositions of nonsmooth functions, Smoothing methods for nonsmooth, nonconvex minimization
Uses Software
Cites Work
- Unnamed Item
- A new trust region algorithm for bound constrained minimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A trust-region strategy for minimization on arbitrary domains
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Minimization of Locally Lipschitzian Functions
- Monotone Operators and the Proximal Point Algorithm
- On the Resolution of Linearly Constrained Convex Minimization Problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
- Iteration Functions in Some Nonsmooth Optimization Algorithms
- Convex Analysis