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 +3 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 +2 more sources
A Linesearch Algorithm with Memory for Unconstrained Optimization [PDF]
, 1998 This paper considers algorithms for unconstrained nonlinear optimization where the model used by the algorithm to represent the objective function explicitly includes memory of the past iterations. This is intended to make the algorithm less “myopic” in the sense that its behaviour is not completely dominated by the local nature of the objective ...
GOULD N. +3 more
openaire +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
LARGE SCALE UNCONSTRAINED OPTIMIZATION [PDF]
, 2009 This work is a survey on the methods for large scale unconstrained optimization. Besides its own theoretical importance, the growing interest in the last years in solving problems with a larger and larger number of variables are arising very frequently ...
ROMA, Massimo
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
Robust optimization in simulation: Taguchi and Krige combined [PDF]
, 2011 Optimization of simulated systems is the goal of many methods, but most methods assume known environments. We, however, develop a "robust" methodology that accounts for uncertain environments.
Jack P. C. Kleijnen +9 more
core +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 +2 more sources
Massive Data Classification via Unconstrained Support Vector Machines [PDF]
, 2006 A highly accurate algorithm, based on support vector machines formulated as linear programs [13, 1], is proposed here as a completely unconstrained minimization problem [15].
O. L. Mangasarian +3 more
core +2 more sources