Jean-Louis Goffin

Dominique Orban

Optim. Methods Softw., 2017

2009

Nondifferentiable Optimization: Cutting Plane Methods.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nondifferentiable Optimization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2007

A matrix generation approach for eigenvalue optimization.

[BibT_eX]

[DOI]

Mohammad R. Oskoorouchi

Math. Program., 2007

2005

Exact solution of the centralized network design problem on directed graphs.

[BibT_eX]

[DOI]

Fatma Gzara

Networks, 2005

An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities.

[BibT_eX]

[DOI]

Mohammad R. Oskoorouchi

Math. Oper. Res., 2005

Efficient Production-Distribution System Design.

[BibT_eX]

[DOI]

Manag. Sci., 2005

The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach.

[BibT_eX]

[DOI]

Michel Denault

INFORMS J. Comput., 2005

2004

The integration of an interior-point cutting plane method within a branch-and-price algorithm.

[BibT_eX]

[DOI]

Math. Program., 2004

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach.

[BibT_eX]

[DOI]

Michel Denault

Comput. Oper. Res., 2004

2003

The Analytic Center Cutting Plane Method with Semidefinite Cuts.

[BibT_eX]

[DOI]

Mohammad R. Oskoorouchi

SIAM J. Optim., 2003

2002

Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method.

[BibT_eX]

[DOI]

Faranak Sharifi Mokhtarian

Optim. Methods Softw., 2002

An analytic center quadratic cut method for the convex quadratic feasibility problem.

[BibT_eX]

[DOI]

Math. Program., 2002

2000

Multiple Cuts in the Analytic Center Cutting Plane Method.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

1999

Shallow, deep and very deep cuts in the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Program., 1999

Convergence of a simple subgradient level method.

[BibT_eX]

[DOI]

Krzysztof C. Kiwiel

Math. Program., 1999

A two-cut approach in the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1999

On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities.

[BibT_eX]

[DOI]

Michel Denault

Faranak Sharifi Mokhtarian

Comput. Optim. Appl., 1999

1998

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 1998

On Improvements to the Analytic Center Cutting Plane Method.

[BibT_eX]

[DOI]

Olivier du Merle

Comput. Optim. Appl., 1998

1997

An analytic center cutting plane method for pseudomonotone variational inequalities.

[BibT_eX]

[DOI]

Patrice Marcotte

Daoli Zhu

Oper. Res. Lett., 1997

1996

Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems.

[BibT_eX]

[DOI]

Zhi-Quan Luo

Yinyu Ye

SIAM J. Optim., 1996

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Program., 1996

1995

A cutting plane method from analytic centers for stochastic programming.

[BibT_eX]

[DOI]

Math. Program., 1995

1994

Short Steps with Karmarkar's Projective Algorithm for Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1994

Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.

[BibT_eX]

[DOI]

Math. Program., 1993

1984

Variable metric relaxation methods, part II: The ellipsoid method.

[BibT_eX]

[DOI]

Math. Program., 1984

1983

Convergence Rates of the Ellipsoid Method on General Convex Functions.

[BibT_eX]

[DOI]

Math. Oper. Res., 1983

1982

Convergence of a cyclic ellipsoid algorithm for systems of linear equalities.

[BibT_eX]

[DOI]

Math. Program., 1982

On the non-polynomiality of the relaxation method for systems of linear inequalities.

[BibT_eX]

[DOI]

Math. Program., 1982

1980

The Relaxation Method for Solving Systems of Linear Inequalities.

[BibT_eX]

[DOI]

Math. Oper. Res., 1980

1977

On convergence rates of subgradient optimization methods.

[BibT_eX]

[DOI]

Math. Program., 1977

1973

Necessary Conditions and Sufficient Conditions for Pareto Optimality in a Multicriterion Perturbed System.

[BibT_eX]

[DOI]