The projection technique for two open problems of unconstrained optimization problems

DOI10.1007/S10957-020-01710-0zbMATH Open1450.90037OpenAlexW3042281539MaRDI QIDQ2194129FDOQ2194129

Authors: Xiaoliang Wang, Zhou Sheng, Gonglin 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

Recommendations

• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• The global convergence of a modified BFGS method for nonconvex functions
• A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
• scientific article; zbMATH DE number 1159286

zbMATH Keywords

nonlinear programmingglobal convergenceBFGS methodPRP methodnonconvex functionsMuskingum model

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites Work

• Local convergence analysis for partitioned quasi-Newton updates
• Algorithm 851
• Variable Metric Method for Minimization
• A Rapidly Convergent Descent Method for Minimization
• Benchmarking optimization software with performance profiles.
• Title not available (Why is that?)
• 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
• Conditioning of Quasi-Newton Methods for Function Minimization
• Title not available (Why is that?)
• An unconstrained optimization test functions collection
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• 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
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A projection method for a system of nonlinear monotone equations with convex constraints
• Spectral gradient projection method for solving nonlinear monotone equations
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A class of derivative-free methods for large-scale nonlinear monotone equations
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Quasi-Newton Methods, Motivation and Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A conjugate gradient method with descent direction for unconstrained optimization
• The convergence properties of some new conjugate gradient methods
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A New Algorithm for Unconstrained Optimization
• A modified BFGS method and its global convergence in nonconvex minimization
• New quasi-Newton equation and related methods for unconstrained optimization
• The BFGS method with exact line searches fails for non-convex objective functions
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Convergence Properties of Algorithms for Nonlinear Optimization
• 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
• Convergence Properties of the BFGS Algoritm
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Convergence analysis of a modified BFGS method on convex minimizations
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• 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
• Title not available (Why is that?)
• A projection method for convex constrained monotone nonlinear equations with applications
• The divergence of the BFGS and Gauss Newton methods
• Spectral gradient method for impulse noise removal
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• On the Convergence of the Variable Metric Algorithm
• An SQP-type method and its application in stochastic programs
• The global convergence of a modified BFGS method for nonconvex functions
• A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• On the convergence properties of the unmodified PRP method with a non-descent line search
• Convergence of DFP algorithm
• A perfect example for the BFGS method
• A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
• Title not available (Why is that?)

Cited In (10)

• A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
• Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
• An adaptive projection BFGS method for nonconvex unconstrained optimization problems
• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
• 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
• Two-Metric Projection Methods for Constrained Optimization
• A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems
• A structured L-BFGS method and its application to inverse problems

Uses Software

• CG_DESCENT
• ve08

This page was built for publication: The projection technique for two open problems of unconstrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194129)