Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities

DOI10.1137/S1052623497324813zbMath0971.65060OpenAlexW2057266149MaRDI QIDQ4702306

Jean-Philippe Vial, Yu. E. Nesterov

Publication date: 24 November 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497324813

zbMATH Keywords

analytic centersvariational inequalitiescutting plane methodextended spaceconvex problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37)

Related Items (10)

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Solving variational inequalities defined on a domain with infinitely many linear constraints ⋮ Dual extrapolation and its applications to solving variational inequalities and related problems ⋮ Accelerated schemes for a class of variational inequalities ⋮ A column generation heuristic for optimal wireless sensor network design with mobile sinks ⋮ Comparison of bundle and classical column generation ⋮ An oracle based method to compute a coupled equilibrium in a model of international climate policy ⋮ A Game of International Climate Policy Solved by a Homogeneous Oracle-Based Method for Variational Inequalities ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ Homogeneous analytic center cutting plane methods with approximate centers

This page was built for publication: Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities