A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58906018, #quickstatements; #temporary_batch_1705020570124
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/503242 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073390894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytic center cutting plane method for pseudomonotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane method for solving quasimonotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method based on approximate subgradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Nonsmooth Convex Minimization With Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximations with finite precision in bundle methods for nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2710356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing and stationary sequences of convex constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilayer feedforward networks are universal approximators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:20, 6 July 2024

scientific article
Language Label Description Also known as
English
A proximal analytic center cutting plane algorithm for solving variational inequality problems
scientific article

    Statements

    A proximal analytic center cutting plane algorithm for solving variational inequality problems (English)
    0 references
    0 references
    0 references
    3 June 2013
    0 references
    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.
    0 references

    Identifiers