Results 31 to 40 of about 1,594 (145)

A combined first and second order model for a junction with ramp buffer [PDF]

open access: yesSMAI Journal of Computational Mathematics, 2019
Second order macroscopic traffic flow models are able to reproduce the so-called capacity drop effect, i.e., the phenomenon that the outflow of a congested region is substantially lower than the maximum achievable flow.
J. Weißen, O. Kolb, Simone Gottlich
semanticscholar   +1 more source

Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]

open access: yes, 2014
This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core   +1 more source

On generalized derivatives for C1,1 vector optimization problems

open access: yesJournal of Applied Mathematics, Volume 2003, Issue 7, Page 365-376, 2003., 2003
We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second‐order optimality conditions for vector optimization problems involving C1,1 data. We show that these conditions are stronger than those in literature obtained by means of second‐order Clarke subdifferential.
Davide La Torre
wiley   +1 more source

On best proximity point of ψ-Geraghty contractions

open access: yes, 2013
Very recently, Caballero, Harjani and Sadarangani (Fixed Point Theory Appl. 2012:231, 2012) observed some best proximity point results for Geraghty contractions by using the P-property.
E. Karapınar
semanticscholar   +1 more source

Sensitivity analysis for parametric vector optimization problems using differential equations approach

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 25, Issue 9, Page 621-628, 2001., 2001
A new method for obtaining sensitivity information for parametric vector optimization problems (VOP) v is presented, where the parameters in the objective functions and anywhere in the constraints. This method depends on using differential equations technique for solving multiobjective nonlinear programing problems which is very effective in finding ...
Fatma M. Ali
wiley   +1 more source

A new branch and bound algorithm for minimax ratios problems

open access: yesOpen 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

Best proximity point theorems for multivalued mappings on partially ordered metric spaces

open access: yes, 2016
In this paper, we prove some best proximity point theorems for multivalued mappings in the setting of complete partially ordered metric spaces. As an application, we infer best proximity point and fixed point results for single valued mappings in ...
V. Pragadeeswarar   +2 more
semanticscholar   +1 more source

A remark on Gwinner′s existence theorem on variational inequality problem

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 8, Page 573-575, 2000., 2000
Gwinner (1981) proved an existence theorem for a variational inequality problem involving an upper semicontinuous multifunction with compact convex values. The aim of this paper is to solve this problem for a multifunction with open inverse values.
V. Vetrivel, S. Nanda
wiley   +1 more source

A New Filled Function for Global Optimization

open access: yesAnalele 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   +2 more
doaj   +1 more source

Optimizing condition numbers [PDF]

open access: yes, 2009
In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core   +1 more source

Home - About - Disclaimer - Privacy