Results 31 to 40 of about 1,159 (105)

A new branch and bound algorithm for minimax ratios problems

Open Mathematics, 2017
This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj   +1 more source

A New Filled Function for Global Optimization

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023
The filled function method has recently become very popular in optimization theory, as it is an e cient and e ective method for finding the global minimizer of multimodal functions.
Şahiner Ahmet, Ermiş Temel, Awan Muhammad Wasim   +2 more
doaj   +1 more source

Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization

Demonstratio Mathematica
It is of strong theoretical significance and application prospects to explore three-block nonconvex optimization with nonseparable structure, which are often modeled for many problems in machine learning, statistics, and image and signal processing.
Zhao Ying, Lan Heng-you, Xu Hai-yang
doaj   +1 more source

Algorithms Based on Unions of Nonexpansive Maps

, 2018
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be expressed as ...
Tam, Matthew K.
core   +1 more source

Computing integral solutions of complementarity problems [PDF]

, 2005
AMS classifications: 90C33, 90C26, 91B50.
Laan, G. van der, Talman, A.J.J., Yang, Z.   +2 more
core   +5 more sources

A modified Liu-Storey conjugate gradient projection algorithm for nonlinear monotone equations

, 2014
In this paper, a modified Liu-Storey (LS) conjugate gradient projection algorithm is proposed for solving nonlinear monotone equations based on a hyperplane projection technique.
Yaping Hu, Zengxin Wei
semanticscholar   +1 more source

GLOBAL OPTIMIZATION APPROACH TO UTILITY MAXIMIZATION PROBLEM

, 2015
We consider the utility maximization problem for oligopsonistic market which is nonconvex optimization problem. Unlike the utility maximization for competitive market, the problem belongs to a class of global optimization. The purpose of this paper is to
R. Enkhbat, J. Enkhbayar, A. Griewank
semanticscholar   +1 more source

Applications of the Fréchet subdifferential [PDF]

, 2003
2000 Mathematics Subject Classification: 46A30, 54C60, 90C26.In this paper we prove two results of nonsmooth analysis involving the Fréchet subdifferential.
Durea, M.
core  

Best proximity point theorems for reckoning optimal approximate solutions

, 2012
Given a non-self mapping from A to B, where A and B are subsets of a metric space, in order to compute an optimal approximate solution of the equation Sx=x, a best proximity point theorem probes into the global minimization of the error function x⟶d(x,Sx)
S. Basha, N. Shahzad, R. Jeyaraj
semanticscholar   +1 more source

GLOBAL CONVERGENCE OF THE TMR METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS

, 2017
Conjugate gradient methods are probably the most famous iterative methods for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is
T. Bouali, M. Belloufi, R. Guefaifia
semanticscholar   +1 more source