An analytic center cutting plane algorithm for finding equilibrium points

DOI10.1051/RO:2006008MaRDI QIDQ3430945zbMATH OpenOpenAlexFDO

Authors Wilfredo Sosa, Fernanda M. P. Raupp

Publication date 5 April 2007

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2006__40_1_37_0, http://www.numdam.org/item?id=RO_2006__40_1_37_0/, https://eudml.org/doc/105337

zbMATH Keywords

equilibrium problemsconvex feasibility problemanalytic center cutting plane algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• Iterative Algorithms for Equilibrium Problems
• Numerical solution of an equilibrium problem of based on the generalized level method
• Analytic center cutting plane methods for variational inequalities over convex bodies
• Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
• An analytic center cutting plane method for pseudomonotone variational inequalities

Cites work

• scientific article; zbMATH DE number 4041641 (Why is no real title available?)
• scientific article; zbMATH DE number 3472891 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 1090020 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 4121751 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• scientific article; zbMATH DE number 3416594 (Why is no real title available?)
• A Potential Reduction Algorithm Allowing Column Generation
• A center cutting plane algorithm for a likelihood estimate problem
• A note on equilibrium problems with properly quasimonotone bifunctions
• A stabilization method for equilibrium programming problems with an approximately given set
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Iterative Algorithms for Equilibrium Problems
• New existence results for equilibrium problems
• Note on noncooperative convex games
• Path-Following Methods for Linear Programming
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Cited in

(1)

• Twelve monotonicity conditions arising from algorithms for equilibrium problems

This page was built for publication: An analytic center cutting plane algorithm for finding equilibrium points

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