Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
From MaRDI portal
Publication:2808328
DOI10.1080/02331934.2014.906596zbMath1337.90070OpenAlexW2017621043MaRDI QIDQ2808328
Benar Fux Svaiter, Mauricio Romero Sicre
Publication date: 23 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.906596
Convex programming (90C25) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
Cites Work
- A logarithmic-quadratic proximal method for variational inequalities
- A primal-dual infeasible-interior-point algorithm for linear programming
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Path-Following Methods for Linear Programming
- Monotone Operators and the Proximal Point Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- Generalized Linear Complementarity Problems
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Complexity of a noninterior path-following method for the linear complementarity problem
