Higher-Order Optimality Conditions for Degenerate Unconstrained Optimization Problems [PDF]
Journal of Optimization, Differential Equations and Their Applications, 2022 In this paper necessary and sufficient conditions of a minimum for the unconstrained degenerate optimization problem are presented. These conditions generalize the well-known optimality conditions.
Viktor Zadachyn
doaj +2 more sources
A Novel Self-Adaptive Trust Region Algorithm for Unconstrained Optimization
Journal of Applied Mathematics, 2014 A new self-adaptive rule of trust region radius is introduced, which is given by a piecewise function on the ratio between the actual and predicted reductions of the objective function.
Yunlong Lu +3 more
doaj +2 more sources
New Conjugate Gradient Method for Unconstrained Optimization with Logistic Mapping [PDF]
Science Journal of University of Zakho, 2016 In this paper , we suggested a new conjugate gradient algorithm for unconstrained optimization based on logistic mapping, descent condition and sufficient descent condition for our method are provided. Numerical results show that our presented algorithm
Shareef G. Shareef +2 more
doaj +1 more source
A spectral Fletcher-Reeves conjugate gradient method with integrated strategy for unconstrained optimization and portfolio selection. [PDF]
PLoS ONEThe 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 ...
Nasiru Salihu +4 more
doaj +2 more sources
Modified sequential unconstrained minimization technique methods for constrained optimization.
, 1994 Modified sequential unconstrained minimization technique methods for constrained ...
Lixing. Jia (7984664)
core +5 more sources
Modifications of the Limited Memory BFGS Algorithm for Large-scale Nonlinear Optimization [PDF]
, 2005 In this paper we present two new numerical methods for unconstrained large-scale optimization. These methods apply update formulae, which are derived by considering different techniques of approximating the objective function.
June, Leong Wah, Hassan, Malik Abu
core +1 more source
Modifying Of Barzilai and Borwein Method for Solving Large-Scale Unconstrained Optimization Problems. [PDF]
المجلة العراقية للعلوم الاحصائية, 2007 In this paper we present a technique for computing the minimum value of an objective function in the frame of gradient descent methods based on combination of Barzilai and Borwein approximation of Hessian matrix of objective function and Lipchetz ...
Khalil K. Abbo
doaj +1 more source
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems [PDF]
Control and Optimization in Applied Mathematics, 2018 In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({\tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems.
Farzad Rahpeymaii, Majid Rostami
doaj +1 more source
Globally convergent algorithms for solving unconstrained optimization problems [PDF]
, 2013 New algorithms for solving unconstrained optimization problems are presented based on the idea of combining two types of descent directions: the direction of anti-gradient and either the Newton or quasi-Newton directions.
Mammadov, Musa +2 more
core +1 more source
Approximating Hessians in unconstrained optimization arising from discretized problems [PDF]
, 2011 Unconstrained optimization, Discretized problems, Sparsity, Partial separability, Numerical experiences,
Vincent Malmedy +3 more
core +1 more source