Homogeneous analytic center cutting plane methods with approximate centers
From MaRDI portal
Publication:4504783
DOI10.1080/10556789908805753zbMath0957.90131OpenAlexW2001118111MaRDI QIDQ4504783
Jean-Philippe Vial, Olivier Péton, Yu. E. Nesterov
Publication date: 6 December 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805753
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)
Related Items
A feasible directions method for nonsmooth convex optimization, A Game of International Climate Policy Solved by a Homogeneous Oracle-Based Method for Variational Inequalities
Cites Work
- Unnamed Item
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- An analytic center cutting plane method for pseudomonotone variational inequalities
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems