Abstract An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities whose domains are bounded or unbounded convex bodies
textabstractWe study a variational inequality problem whose domain is defined by infinitely many lin...
We present a variant of the analytic center cutting plane algorithm proposed by Goffin et al. (1996)...
© Published under licence by IOP Publishing Ltd.We propose an algorithm for solving a convex program...
In this paper we consider a new analytic center cutting plane method in an extended space. We prove ...
In this paper we consider a homogeneous analytic center cutting plane method in a projective space. ...
In this paper we consider a homogeneous analytic center cutting plane method in a projective space. ...
In this paper we consider a new analytic center cutting plane method in a projective space.We prove ...
This thesis concerns the solution of variational inequalities (VIs) with analytic center cutting pla...
Interior-point methods have not only shown their efficiency for linear and some nonlinear programmin...
We present an algorithm for variational inequalities V I(F; Y) that uses a primal-dual version of th...
. The paper considers two cases of variational inequality problems. The first case involves an affin...
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. T...
We analyze the complexity of the analytic center cutting plane or column generation algorithm for so...
We present a survey of nondifferentiable optimization problems and methods with special focus on the...
We are concerned in this note with an application of an advanced implementation of Goffin and Vial's...
textabstractWe study a variational inequality problem whose domain is defined by infinitely many lin...
We present a variant of the analytic center cutting plane algorithm proposed by Goffin et al. (1996)...
© Published under licence by IOP Publishing Ltd.We propose an algorithm for solving a convex program...
In this paper we consider a new analytic center cutting plane method in an extended space. We prove ...
In this paper we consider a homogeneous analytic center cutting plane method in a projective space. ...
In this paper we consider a homogeneous analytic center cutting plane method in a projective space. ...
In this paper we consider a new analytic center cutting plane method in a projective space.We prove ...
This thesis concerns the solution of variational inequalities (VIs) with analytic center cutting pla...
Interior-point methods have not only shown their efficiency for linear and some nonlinear programmin...
We present an algorithm for variational inequalities V I(F; Y) that uses a primal-dual version of th...
. The paper considers two cases of variational inequality problems. The first case involves an affin...
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. T...
We analyze the complexity of the analytic center cutting plane or column generation algorithm for so...
We present a survey of nondifferentiable optimization problems and methods with special focus on the...
We are concerned in this note with an application of an advanced implementation of Goffin and Vial's...
textabstractWe study a variational inequality problem whose domain is defined by infinitely many lin...
We present a variant of the analytic center cutting plane algorithm proposed by Goffin et al. (1996)...
© Published under licence by IOP Publishing Ltd.We propose an algorithm for solving a convex program...