Local convergence analysis of an inexact trust-region method for nonsmooth optimization
From MaRDI portal
Publication:6204197
DOI10.1007/s11590-023-02092-8MaRDI QIDQ6204197
Drew P. Kouri, Robert J. Baraldi
Publication date: 27 March 2024
Published in: Optimization Letters (Search for Journal in Brave)
nonsmooth optimizationNewton's methodnonconvex optimizationquadratic convergencesuperlinear convergencetrust region
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Convergence of inexact Newton methods for generalized equations
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Two new unconstrained optimization algorithms which use function and gradient values
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Inexact trust-region methods for PDE-constrained optimization
- Local convergence of quasi-Newton methods under metric regularity
- A Trust-Region Algorithm with Adaptive Stochastic Collocation for PDE Optimization under Uncertainty
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Generalized Multilevel SQP-methods for PDAE-constrained Optimization Based on Space-Time Adaptive PDAE Solvers
- Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Implicit Functions and Solution Mappings
- Inexact Newton Methods
- Trust Region Methods
- First-Order Methods in Optimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Generalizations of the Dennis--Moré Theorem
- Randomized Sketching Algorithms for Low-Memory Dynamic Optimization
- Inexact Objective Function Evaluations in a Trust-Region Algorithm for PDE-Constrained Optimization under Uncertainty
- An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids
- Inexact Newton Methods and Dennis--Moré Theorems for Nonsmooth Generalized Equations
- A Locally Adapted Reduced-Basis Method for Solving Risk-Averse PDE-Constrained Optimization Problems
This page was built for publication: Local convergence analysis of an inexact trust-region method for nonsmooth optimization