A spectral Fletcher-Reeves conjugate gradient method with integrated strategy for unconstrained optimization and portfolio selection. [PDF]
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 ...
Nasiru Salihu +4 more
doaj +2 more sources
On the hardness of quadratic unconstrained binary optimization problems
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions.
V. Mehta +7 more
doaj +1 more source
Spectral proximal method for solving large scale sparse optimization [PDF]
In this paper, we propose to use spectral proximal method to solve sparse optimization problems. Sparse optimization refers to an optimization problem involving the ι0 -norm in objective or constraints.
Woo Gillian Yi Han +3 more
doaj +1 more source
Partial Davidon, Fletcher and Powell (DFP) of quasi newton method for unconstrained optimization
The nonlinear Quasi-newton methods is widely used in unconstrained optimization. However, In this paper, we developing new quasi-Newton method for solving unconstrained optimization problems.
Basheer M. Salih +2 more
doaj +1 more source
A Sufficient Descent Property for a Different Parameter to Enhance Three-Term Method [PDF]
In this paper, we derive a new parameter µk-1 for the three-term CG (N3T) algorithm for solving unconstrained optimization problems. As demonstrated by its calculations and proof, the parameter µk-1 worth is determined by T , and the study ...
Ghada Al-Naemi, Samaa Al-bakri
doaj +1 more source
Partial Pearson-two (PP2) of quasi newton method for unconstrained optimization
In this paper, we developing new quasi-Newton method for solving unconstrained optimization problems .The nonlinear Quasi-newton methods is widely used in unconstrained optimization[1]. However,.
Basheer M. Salih +2 more
doaj +1 more source
A Combined Cubic and Novel Line Search CG-Algorithm [PDF]
In this paper a new line search technique is investigated. It uses (cubic and novel) line searches in the standard CG-algorithm for unconstrained optimization.
Abbas Al-Bayati, Hamsa Chilmerane
doaj +1 more source
A Modified Genetic Algorithm in C++ for Optimization of Steel Truss Structures [PDF]
A common structural design optimization problem is weight minimization which is done by choosing a set of variables that represent the structural or the architectural configuration of the system satisfying few design specific criterion.
Pawan Kumar +2 more
doaj +1 more source
We adopt the alternating direction search pattern method to solve the equality and inequality constrained nonlinear optimization problems. Firstly, a new augmented Lagrangian function with a nonlinear complementarity function is proposed to transform the
Aifen Feng +3 more
doaj +1 more source
Modified new conjugate gradient method for Unconstrained Optimization
The current paper modified method of conjugate gradient for solving problems of unconstrained optimization. The modified method convergence is achieved by assuming some hypotheses.
Zeyad M. Abdullah +3 more
doaj +1 more source

