A subspace conjugate gradient algorithm for large-scale unconstrained optimization
Sign Up to like & getrecommendations! Published in 2017 at "Numerical Algorithms"
DOI: 10.1007/s11075-017-0284-2
Abstract: In this paper, a subspace three-term conjugate gradient method is proposed. The search directions in the method are generated by minimizing a quadratic approximation of the objective function on a subspace. And they satisfy the… read more here.
Keywords: gradient; subspace; unconstrained optimization; conjugate gradient ... See more keywords
A new modified BFGS method for unconstrained optimization problems
Sign Up to like & getrecommendations! Published in 2018 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-018-0620-8
Abstract: Using chain rule, we propose a modified secant equation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant equation we present a new BFGS… read more here.
Keywords: bfgs method; unconstrained optimization; method; optimization problems ... See more keywords
Unconstrained optimization reformulation for stochastic nonlinear complementarity problems
Sign Up to like & getrecommendations! Published in 2019 at "Applicable Analysis"
DOI: 10.1080/00036811.2019.1636969
Abstract: Abstract We present an unconstrained optimization reformulation for the stochastic nonlinear complementarity problem in this paper, which aims at minimizing an expected residual defined by the D-gap function. We discuss the existence of a solution… read more here.
Keywords: reformulation stochastic; stochastic nonlinear; nonlinear complementarity; unconstrained optimization ... See more keywords
A New Unconstrained Optimization Approach to Solving Mixed Split Feasibility Problems
Sign Up to like & getrecommendations! Published in 2025 at "Numerical Functional Analysis and Optimization"
DOI: 10.1080/01630563.2025.2522385
Abstract: Abstract We introduce an unconstrained optimization approach to solving mixed split feasibility problems in Hilbert spaces. We use a method of selecting the control parameters so that the implementation of our algorithms does not require… read more here.
Keywords: unconstrained optimization; split; optimization approach; split feasibility ... See more keywords
On unconstrained optimization problems solved using the canonical duality and triality theories
Sign Up to like & getrecommendations! Published in 2019 at "Optimization"
DOI: 10.1080/02331934.2019.1672072
Abstract: DY Gao solely or together with some of his collaborators applied his Canonical duality theory (CDT) for solving a class of unconstrained optimization problems, getting the so-called triality theorems. Unfortunately, the ‘double-min duality’ from these… read more here.
Keywords: duality; canonical duality; unconstrained optimization; optimization problems ... See more keywords
An efficient hybrid conjugate gradient method for unconstrained optimization
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2021.1998490
Abstract: In this paper, we propose a hybrid conjugate gradient method for unconstrained optimization, obtained by a convex combination of the LS and KMD conjugate gradient parameters. A favourite property of the proposed method is that… read more here.
Keywords: unconstrained optimization; conjugate gradient; method;
Distributed Inexact Consensus-Based ADMM Method for Multi-Agent Unconstrained Optimization Problem
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2923269
Abstract: Recently, the alternating direction method of multipliers (ADMM) has been used effectively to solve the multi-agent unconstrained optimization problems, where the objective function is the sum of privately known local objective functions of agents. In… read more here.
Keywords: optimization; consensus; multi agent; optimization problem ... See more keywords
Modified Three-Term Liu–Storey Conjugate Gradient Method for Solving Unconstrained Optimization Problems and Image Restoration Problems
Sign Up to like & getrecommendations! Published in 2020 at "Mathematical Problems in Engineering"
DOI: 10.1155/2020/7859286
Abstract: A new three-term conjugate gradient method is proposed in this article. The new method was able to solve unconstrained optimization problems, image restoration problems, and compressed sensing problems. The method is the convex combination of… read more here.
Keywords: gradient method; unconstrained optimization; method; three term ... See more keywords
A modified nonmonotone BFGS algorithm for unconstrained optimization
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Inequalities and Applications"
DOI: 10.1186/s13660-017-1453-5
Abstract: In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The proposed algorithm has the following properties: (i) a nonmonotone line search technique is used to obtain the step size αk$\alpha_{k}$ to improve… read more here.
Keywords: nonmonotone bfgs; bfgs algorithm; unconstrained optimization; modified nonmonotone ... See more keywords
A spectral Fletcher-Reeves conjugate gradient method with integrated strategy for unconstrained optimization and portfolio selection
Sign Up to like & getrecommendations! Published in 2025 at "PLOS One"
DOI: 10.1371/journal.pone.0320416
Abstract: The spectral conjugate gradient (SCG) technique is highly efficient in addressing large-scale unconstrained optimization challenges. This paper presents a structured SCG approach that combines the Quasi-Newton direction and an extended conjugacy condition. Drawing inspiration from… read more here.
Keywords: fletcher reeves; method; conjugate gradient; unconstrained optimization ... See more keywords
Improvement of Unconstrained Optimization Methods Based on Symmetry Involved in Neutrosophy
Sign Up to like & getrecommendations! Published in 2023 at "Symmetry"
DOI: 10.3390/sym15010250
Abstract: The influence of neutrosophy on many fields of science and technology, as well as its numerous applications, are evident. Our motivation is to apply neutrosophy for the first time in order to improve methods for… read more here.
Keywords: improvement; symmetry involved; optimization methods; unconstrained optimization ... See more keywords