Algorithms to determine the point of minimum of a real unimodal function on a set – a survey
Ioana Chiorean ♦ Liana Lupsa
Abstract
carpathian_2009_25_1_037_048_abstractUsing the cuts technique, the authors present in this paper a general algorithm to determine the optimal point of an unimodal function on a set. The parallel version of this algorithm is also given
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration