A proximal analytic center cutting plane algorithm for solving variational inequality problems
type: Item
instance of: scholarly article
title: A proximal analytic center cutting plane algorithm for solving variational inequality problems
zbMATH Open document ID: 1264.65099
DOI: 10.1155/2012/503242
author: Jie Shen
author: Li-Ping Pang
published in: Journal of Applied Mathematics
publication date: 2013-06-03T00:00:00Z
review text: Summary: Under the condition that the values of mapping \(F\) are evaluated approximately, we propose a proximal analytic center cutting plane algorithm for solving variational inequalities. It can be considered as an approximation of the earlier cutting plane method, and the conditions we impose on the corresponding mappings are more relaxed. The convergence analysis for the proposed algorithm is also given at the end of this paper.
Mathematics Subject Classification ID: 65K15
zbMATH DE Number: 6169927
Wikidata QID: Q58906018
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/503242
OpenAlex ID: W2073390894
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: On constrained optimization by adjoint based quasi-Newton methods
cites work: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
cites work: An analytic center cutting plane method for pseudomonotone variational inequalities
cites work: A cutting plane method for solving quasimonotone variational inequalities
cites work: A proximal bundle method based on approximate subgradients
cites work: An Algorithm for Nonsmooth Convex Minimization With Errors
cites work: On approximations with finite precision in bundle methods for nonsmooth optimization
cites work: Q4209222
cites work: Q4001523
cites work: Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian
cites work: Minimizing and stationary sequences of convex constrained minimization problems
cites work: Q4673624
cites work: Q4091727
cites work: Multilayer feedforward networks are universal approximators
cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
DBLP publication ID: journals/jam/ShenP12
description: scientific article; zbMATH DE number 6169927