Results 101 to 110 of about 174 (149)

On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems

open access: yes, 1996
A generalized class of infeasible-interior-point methods for solving horizontal linear complementarity problem is analyzed and sufficient conditions are given for the convergence of the sequence of iterates produced by methods in this class.
J. Frédéric Bonnans, Florian A. Potra
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  

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  

Home - About - Disclaimer - Privacy