A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
From MaRDI portal
Publication:6165597
DOI10.1007/S10107-022-01915-3zbMATH Open1522.90113OpenAlexW4312179964MaRDI QIDQ6165597FDOQ6165597
Authors: Robert J. Baraldi, D. P. Kouri 
Publication date: 1 August 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01915-3
Recommendations
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- A trust region method for nonsmooth convex optimization
- A trust region algorithm for nonsmooth optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A trust region method for minimization of nonsmooth functions with linear constraints
nonconvex optimizationnonlinear programmingnonsmooth optimizationNewton's methodlarge-scale optimizationtrust regions
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- iPiano: inertial proximal algorithm for nonconvex optimization
- Probing the Pareto frontier for basis pursuit solutions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- First-order methods in optimization
- Proximal splitting methods in signal processing
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Title not available (Why is that?)
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- Trust Region Methods
- Title not available (Why is that?)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Adaptive multilevel inexact SQP methods for PDE-constrained optimization
- Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints
- A trust-region algorithm with adaptive stochastic collocation for PDE optimization under uncertainty
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Convergence properties of trust region methods for linear and convex constraints
- Title not available (Why is that?)
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
- Filters in topology optimization based on Helmholtz-type differential equations
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information
- Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information
- A trust region algorithm for minimization of locally Lipschitzian functions
- Title not available (Why is that?)
- Analysis of inexact trust-region SQP algorithms
- Directional sparsity in optimal control of partial differential equations
- Proximal Newton-type methods for minimizing composite functions
- Title not available (Why is that?)
- A model algorithm for composite nondifferentiable optimization problems
- Annular and sectorial sparsity in optimal control of elliptic equations
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Title not available (Why is that?)
- A trust region method for minimization of nonsmooth functions with linear constraints
- Tikhonov regularization of optimal control problems governed by semi-linear partial differential equations
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Inexact trust-region methods for PDE-constrained optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- 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
- A Locally Adapted Reduced-Basis Method for Solving Risk-Averse PDE-Constrained Optimization Problems
- Local and global analysis of multiplier methods for constrained optimization in Banach spaces
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Adaptive FISTA for Nonconvex Optimization
- Lectures on stochastic programming. Modeling and theory
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- Randomized sketching algorithms for low-memory dynamic optimization
Cited In (4)
- Local convergence analysis of an inexact trust-region method for nonsmooth optimization
- Parallel 3D topology optimization with multiple constraints and objectives
- Trust region-type method under inexact gradient and inexact Hessian with convergence analysis
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
This page was built for publication: A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165597)
