A proximal analytic center cutting plane algorithm for solving variational inequality problems
From MaRDI portal
Publication:1952872
DOI10.1155/2012/503242zbMath1264.65099OpenAlexW2073390894WikidataQ58906018 ScholiaQ58906018MaRDI QIDQ1952872
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/503242
Related Items
A note on the optimality condition for a bilevel programming ⋮ Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
Cites Work
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An analytic center cutting plane method for pseudomonotone variational inequalities
- Multilayer feedforward networks are universal approximators
- An Algorithm for Nonsmooth Convex Minimization With Errors
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- On constrained optimization by adjoint based quasi-Newton methods
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximal bundle method based on approximate subgradients
- A cutting plane method for solving quasimonotone variational inequalities
- Minimizing and stationary sequences of convex constrained minimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
