The projection technique for two open problems of unconstrained optimization problems
From MaRDI portal
Publication:2194129
DOI10.1007/s10957-020-01710-0zbMath1450.90037OpenAlexW3042281539MaRDI QIDQ2194129
Zhou Sheng, Xiaoliang Wang, Gong Lin Yuan
Publication date: 25 August 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01710-0
Related Items
A Dai-Liao-type projection method for monotone nonlinear equations and signal processing ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ An adaptive projection BFGS method for nonconvex unconstrained optimization problems ⋮ A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems ⋮ A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems ⋮ A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A three-term derivative-free projection method for nonlinear monotone system of equations
- A short note on the global convergence of the unmodified PRP method
- The divergence of the BFGS and Gauss Newton methods
- Spectral gradient method for impulse noise removal
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- The convergence properties of some new conjugate gradient methods
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP conjugate gradient method
- Efficient hybrid conjugate gradient techniques
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- New quasi-Newton equation and related methods for unconstrained optimization
- A globally convergent version of the Polak-Ribière conjugate gradient method
- An SQP-type method and its application in stochastic programs
- The BFGS method with exact line searches fails for non-convex objective functions
- A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Local convergence analysis for partitioned quasi-Newton updates
- Convergence of DFP algorithm
- A perfect example for the BFGS method
- A projection method for convex constrained monotone nonlinear equations with applications
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- The global convergence of a modified BFGS method for nonconvex functions
- A projection method for a system of nonlinear monotone equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Convergence Properties of Algorithms for Nonlinear Optimization
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- A class of derivative-free methods for large-scale nonlinear monotone equations
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Variable Metric Method for Minimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Quasi-Newton Methods, Motivation and Theory
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Convergence Properties of the BFGS Algoritm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- A Family of Variable-Metric Methods Derived by Variational Means
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- On the Convergence of the Variable Metric Algorithm
- Conditioning of Quasi-Newton Methods for Function Minimization
- A New Algorithm for Unconstrained Optimization
- The conjugate gradient method in extremal problems
- On the convergence properties of the unmodified PRP method with a non-descent line search
- Methods of conjugate gradients for solving linear systems
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: The projection technique for two open problems of unconstrained optimization problems
