Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
From MaRDI portal
Publication:1938913
DOI10.1007/s10589-012-9485-8zbMath1267.90101OpenAlexW2093227229MaRDI QIDQ1938913
Zhong-Xing Wang, Gong Lin Yuan, Zeng-xin Wei
Publication date: 25 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9485-8
Related Items
A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ∞ matrix norm ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration ⋮ A modified conjugate gradient method for general convex functions ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ A Cauchy point direction trust region algorithm for nonlinear equations ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ A memory gradient method for non-smooth convex optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ Correction of trust region method with a new modified Newton method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An active set limited memory BFGS algorithm for bound constrained optimization
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Optimization of upper semidifferentiable functions
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Projected quasi-Newton algorithm with trust region for constrained optimization
- On a subproblem of trust region algorithms for constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A new trust region algorithm for nonsmooth convex minimization
- BFGS trust-region method for symmetric nonlinear equations
- A trust region algorithm for equality constrained optimization
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- Convergence of some algorithms for convex minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- A trust region algorithm for minimization of locally Lipschitzian functions
- Trust region algorithm for nonsmooth optimization
- A new method for nonsmooth convex optimization
- A new trust region method for nonlinear equations
- A family of variable metric proximal methods
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- A nonsmooth version of Newton's method
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
- Nonsmooth Equations: Motivation and Algorithms
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A descent algorithm for nonsmooth convex optimization
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
- QN-like variable storage conjugate gradients
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
- Optimization and nonsmooth analysis
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- Projected gradient methods for linearly constrained problems
- A model algorithm for composite nondifferentiable optimization problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- An Efficient Method to Solve the Minimax Problem Directly
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
- Trust Region Methods
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence analysis of a proximal newton method1
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Numerical methods for nondifferentiable convex optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- Maximization by Quadratic Hill-Climbing
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- An algorithm for solving linearly constrained optimization problems
- A method for the solution of certain non-linear problems in least squares
