Hybrid conjugate gradient-BFGS methods based on Wolfe line search
, 2022 In this paper, we present some hybrid methods for solving unconstrained optimization problems. These methods are defined using proper combinations of the search directions and included parameters in conjugate gradient and quasi-Newton method of Broyden ...
DJAMEL, Benterki, SAMIA, Khelladi
core +1 more source
Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems
Local sensitivity, Mathematical programming, Duality, Closed formulas for sensitivities, 90C31, 90C05, 90C30,
A. Conejo +3 more
core +1 more source
On generalized semi-infinite programming
, 2006 Generalized semi-infinite programming, extended Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constraint qualification, Fritz-John condition, first and second order optimality conditions, optimal value function, directional differentiability, second ...
Alfredo Gomez, J +3 more
core +1 more source
Extended local convergence analysis of inexact Gauss-Newton method for singular systems of equations under weak conditions [PDF]
, 2017 A new local convergence analysis of the Gauss-Newton method for solving some optimization problems is presented using restricted convergence domains. The results extend the applicability of the Gauss-Newton method under the same computational cost given ...
ARGYROS , Ioannis K., GEORGE, Santhosh
core +1 more source
A new optimization method based on Perry's idea through the use of the matrix power [PDF]
, 2021 MSC 2010: 90C30, 90C26, 90C06The purpose of this paper is to present a new conjugate gradient method for solving unconstrained nonlinear optimization problems, based on Perry’s idea.
Imane Hafaidia, Noureddine Benrabia, Mourad Ghiat, Hamza Guebbai
core
A class of r-semipreinvex functions and optimality in nonlinear programming
Semi-connected sets, Semipreinvex functions, r-Semipreinvex functions, Optimality, Nonlinear programming, 90C25, 90C26, 90C30,
Ke Zhao, Zhe Chen, Xue Liu
core +1 more source
Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search [PDF]
, 2010 A trust-region method with two subproblems and backtracking line search for solving unconstrained optimization is proposed. At every iteration, we use the truncated conjugate gradient method or its variation to solve one of the two subproblems ...
Mingyun Tang +3 more
core +1 more source
Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems
Fractional Programming, Parametric Optimization, Nonconvex Programming, Nonlinear Programming, AMS subject classification, 90C32, 90C31, 90C26, 90C30,
Doroteo Verastegui +2 more
core +1 more source
Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
Programación Geométrica, Algoritmos, Langragianos Aumentados, 90C30, Geometric Programming, Algorithms, Augmented Lagrangian Functions,
Eduardo Méndez
core +1 more source