A logarithmic-quadratic proximal method for variational inequalities
From MaRDI portal
Publication:1294804
DOI10.1023/A:1008607511915zbMath1039.90529OpenAlexW1503476534MaRDI QIDQ1294804
Alfred Auslender, Marc Teboulle, Sami Ben-Tiba
Publication date: 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008607511915
global convergencemaximal monotone operatorsvariational inequalitiesinterior point methodsnonlinear complementarityproximal-like methodssaddle point computation
Numerical mathematical programming methods (65K05) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
LQP method with a new optimal step size rule for nonlinear complementarity problems, A note on the existence of zeroes of convexly regularized sums of maximal monotone operators, Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces, A proximal method with logarithmic barrier for nonlinear complementarity problems, Weak and strong convergence of hybrid subgradient method for pseudomonotone equilibrium problem and multivalued nonexpansive mappings, New descent LQP alternating direction methods for solving a class of structured variational inequalities, A descent LQP alternating direction method for solving variational inequality problems with separable structure, The interior proximal extragradient method for solving equilibrium problems, Some proximal algorithms for linearly constrained general variational inequalities, Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, An inexact LQP alternating direction method for solving a class of structured variational inequalities, An inexact proximal method for quasiconvex minimization, An self-adaptive LQP method for constrained variational inequalities, Decomposition Methods Based on Augmented Lagrangians: A Survey, The prediction-correction approach to nonlinear complementarity problems, A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities, A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming, Unnamed Item, The developments of proximal point algorithms, Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming, An inertial parallel algorithm for a finite family of \(G\)-nonexpansive mappings with application to the diffusion problem, An LQP-based descent method for structured monotone variational inequalities, A cutting hyperplane method for solving pseudomonotone non-Lipschitzian equilibrium problems, Unnamed Item, Interior point methods for equilibrium problems, An interior approximal method for solving pseudomonotone equilibrium problems, Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter, A logarithmic-quadratic proximal point scalarization method for multiobjective programming, An LQP-based two-step method for structured variational inequalities, Rescaled proximal methods for linearly constrained convex problems, A new predicto-corrector method for pseudomonotone nonlinear complementarity problems, Modified proximal-point method for nonlinear complementarity problems, An LQP method for pseudomonotone variational inequalities, Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization, Modified Lagrangian methods for separable optimization problems, Outer approximation algorithms for pseudomonotone equilibrium problems, A perturbed projection algorithm with inertial technique for split feasibility problem, On the \(O(1/t)\) convergence rate of the LQP prediction-correction method, An asymmetric proximal decomposition method for convex programming with linearly coupling constraints, Unnamed Item, A self-adaptive descent LQP alternating direction method for the structured variational inequalities, A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, An inexact alternating direction method for solving a class of structured variational inequalities, Logarithmic quasi-distance proximal point scalarization method for multi-objective programming, Interior proximal method without the cutting plane property, An APPA-based descent method with optimal step-sizes for monotone variational inequalities, Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization, A descent SQP alternating direction method for minimizing the sum of three convex functions, A hybrid LQP-based method for structured variational inequalities, Weak co-coercivity and its applications in several algorithms for solving variational inequalities, On the optimal linear convergence rate of a generalized proximal point algorithm, SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure, A generalized proximal-point-based prediction-correction method for variational inequality problems, An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities, On inexact generalized proximal methods with a weakened error tolerance criterion, A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods, Extended LQP method for monotone nonlinear complementarity problems, Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints, On LQP alternating direction method for solving variational inequality problems with separable structure, Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization, Convergence analysis of an inertial accelerated iterative algorithm for solving split variational inequality problem, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, An LQP-SQP alternating direction method for solving variational inequality problems with separable structure, Parallel LQP alternating direction method for solving variational inequality problems with separable structure, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, An improved LQP-based method for solving nonlinear complementarity problems, Interior proximal method for variational inequalities: Case of nonparamonotone operators, Interior Proximal Methods for equilibrium programming: part II, An interior proximal point algorithm for nonlinear complementarity problems, Solving a class of constrained `black-box' inverse variational inequalities, A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers, Double-regularization proximal methods, with complementarity applications, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming, A proximal point algorithm with asymmetric linear term, On a Bregman regularized proximal point method for solving equilibrium problems, The subgradient extragradient method extended to equilibrium problems, Competitive facility location on decentralized supply chains, An LQP-based symmetric alternating direction method of multipliers with larger step sizes, Proximal-point algorithm using a linear proximal term, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, A new LQP alternating direction method for solving variational inequality problems with separable structure, A method with inertial extrapolation step for convex constrained monotone equations, Proximal point algorithms for general variational inequalities, Projection method with inertial step for nonlinear equations: application to signal recovery, Nonlinear proximal decomposition method for convex programming, A class of nonlinear proximal point algorithms for variational inequality problems, An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications, Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size
