A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
From MaRDI portal
Publication:6165597
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 4070647 (Why is no real title available?)
- scientific article; zbMATH DE number 3714432 (Why is no real title available?)
- scientific article; zbMATH DE number 1742537 (Why is no real title available?)
- scientific article; zbMATH DE number 2038815 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 887371 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Locally Adapted Reduced-Basis Method for Solving Risk-Averse PDE-Constrained Optimization Problems
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- A model algorithm for composite nondifferentiable optimization problems
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- A trust region method for minimization of nonsmooth functions with linear constraints
- A trust-region algorithm with adaptive stochastic collocation for PDE optimization under uncertainty
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Adaptive FISTA for Nonconvex Optimization
- Adaptive multilevel inexact SQP methods for PDE-constrained optimization
- An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Analysis of inexact trust-region SQP algorithms
- Annular and sectorial sparsity in optimal control of elliptic equations
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Convergence properties of trust region methods for linear and convex constraints
- Directional sparsity in optimal control of partial differential equations
- 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
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Inexact objective function evaluations in a trust-region algorithm for PDE-constrained optimization under uncertainty
- Inexact trust-region methods for PDE-constrained optimization
- Lectures on stochastic programming. Modeling and theory
- Local and global analysis of multiplier methods for constrained optimization in Banach spaces
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Newton's Method for Large Bound-Constrained Optimization Problems
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- Probing the Pareto frontier for basis pursuit solutions
- Proximal Newton-type methods for minimizing composite functions
- Proximal splitting methods in signal processing
- Randomized sketching algorithms for low-memory dynamic optimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints
- Tikhonov regularization of optimal control problems governed by semi-linear partial differential equations
- Trust Region Methods
- iPiano: inertial proximal algorithm for nonconvex 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)
