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

DOI10.1137/S1052623497324813MaRDI QIDQ4702306zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Vial, Yuri 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 centersconvex problemscutting plane methodextended spacevariational inequalities

Mathematics Subject Classification ID

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

Recommendations

• Analytic center cutting plane methods for variational inequalities over convex bodies
• The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach
• On a primal-dual analytic center cutting plane method for variational inequalities
• A proximal analytic center cutting plane algorithm for solving variational inequality problems
• An analytic center cutting plane method for pseudomonotone variational inequalities
• scientific article; zbMATH DE number 1488009
• An analytic center cutting plane method for solving semi-infinite variational inequality problems
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• An analytic center cutting plane approach for conic programming
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems

Cited in

(13)

• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• Accelerated schemes for a class of variational inequalities
• A column generation heuristic for optimal wireless sensor network design with mobile sinks
• An oracle based method to compute a coupled equilibrium in a model of international climate policy
• Comparison of bundle and classical column generation
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• An anlytic center self-concordant cut method for the convex feasibility problem.
• scientific article; zbMATH DE number 1488009 (Why is no real title available?)
• Homogeneous analytic center cutting plane methods with approximate centers
• A game of international climate policy solved by a homogeneous oracle-based method for variational inequalities
• Analytic center cutting plane methods for variational inequalities over convex bodies
• Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
• Dual extrapolation and its applications to solving variational inequalities and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702306)