Pages that link to "Item:Q1294804"
From MaRDI portal
The following pages link to A logarithmic-quadratic proximal method for variational inequalities (Q1294804):
Displaying 50 items.
- LQP method with a new optimal step size rule for nonlinear complementarity problems (Q264934) (← links)
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- Weak and strong convergence of hybrid subgradient method for pseudomonotone equilibrium problem and multivalued nonexpansive mappings (Q287542) (← links)
- New descent LQP alternating direction methods for solving a class of structured variational inequalities (Q288023) (← links)
- A descent LQP alternating direction method for solving variational inequality problems with separable structure (Q295243) (← links)
- An inexact LQP alternating direction method for solving a class of structured variational inequalities (Q316538) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- A cutting hyperplane method for solving pseudomonotone non-Lipschitzian equilibrium problems (Q388068) (← links)
- An interior approximal method for solving pseudomonotone equilibrium problems (Q394695) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- A perturbed projection algorithm with inertial technique for split feasibility problem (Q442823) (← links)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- An LQP-based descent method for structured monotone variational inequalities (Q609244) (← links)
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming (Q625652) (← links)
- Outer approximation algorithms for pseudomonotone equilibrium problems (Q639071) (← links)
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming (Q668555) (← links)
- An interior proximal point algorithm for nonlinear complementarity problems (Q708086) (← links)
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities (Q853670) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Weak co-coercivity and its applications in several algorithms for solving variational inequalities (Q945238) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Competitive facility location on decentralized supply chains (Q1027530) (← links)
- Proximal-point algorithm using a linear proximal term (Q1028604) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method (Q1684866) (← links)
- An LQP-based two-step method for structured variational inequalities (Q1697893) (← links)
- On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators (Q1873664) (← links)
- Interior point methods for equilibrium problems (Q1928742) (← links)
- Convergence analysis of an inertial accelerated iterative algorithm for solving split variational inequality problem (Q2009514) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers (Q2029140) (← links)
- A method with inertial extrapolation step for convex constrained monotone equations (Q2072994) (← links)
- Projection method with inertial step for nonlinear equations: application to signal recovery (Q2083350) (← links)
- An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications (Q2113211) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- An inertial parallel algorithm for a finite family of \(G\)-nonexpansive mappings with application to the diffusion problem (Q2167224) (← links)
