Results 91 to 100 of about 213 (150)

Global search based on efficient diagonal partitions and a set of Lipschitz constants

open access: yes, 2006
. In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered.
Yaroslav D. Sergeyev, Dmitri, E. Kvasov
core  

Monotonicity Of Primal And Dual Objective Values In Primal-Dual Interior-Point Algorithms

open access: yes, 1994
. We study monotonicity of primal and dual objective values in the framework of primal-dual interior-point methods. The primal-dual affine-scaling algorithm is monotone in both objectives.
Michael J. Todd, Shinji Mizuno
core  

CONVERGENCE ANALYSIS OF THE ITERATIVE METHODS FOR QUASI COMPLEMENTARITY PROBLEMS

open access: yes, 1986
. In this paper, we consider the iterative methods for the quasi complemen-tar Lt problems of the orm u-m(u)>0, T { u))0, u-m(u), T ( u=0, where m is a point-to-point mapping and T is a continuous mapping from R n into itself.
Muhammad Aslam Noor
core  

A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex

open access: yes, 1998
In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value.
Ivo Nowak
core  

Home - About - Disclaimer - Privacy