Pages that link to "Item:Q4652003"
From MaRDI portal
The following pages link to Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems (Q4652003):
Displaying 50 items.
- On the iteration complexity of some projection methods for monotone linear variational inequalities (Q2397469) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization (Q2434980) (← links)
- On the \(O(1/t)\) convergence rate of the LQP prediction-correction method (Q2439520) (← links)
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Adaptive two-stage Bregman method for variational inequalities (Q2668528) (← links)
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem (Q2679571) (← links)
- Adaptive extraproximal algorithm for the equilibrium problem in Hadamard spaces (Q2679793) (← links)
- Stochastic first-order methods for convex and nonconvex functional constrained optimization (Q2689819) (← links)
- An implicit gradient-descent procedure for minimax problems (Q2699028) (← links)
- A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization (Q2802143) (← links)
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm (Q2807288) (← links)
- Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
- A subgradient method for free material design (Q2832891) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging (Q3192655) (← links)
- A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities (Q3449570) (← links)
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems (Q3451761) (← links)
- Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems (Q3465236) (← links)
- Iterative Methods for the Elastography Inverse Problem of Locating Tumors (Q4554325) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
- Variational Gram Functions: Convex Analysis and Optimization (Q4602347) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
- An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate (Q4629373) (← links)
- (Q4637040) (← links)
- Proximal extrapolated gradient methods for variational inequalities (Q4638915) (← links)
- (Q4901199) (← links)
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
- A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems (Q4989936) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- (Q4999039) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- (Q5020878) (← links)
- A new efficient algorithm for finding common fixed points of multivalued demicontractive mappings and solutions of split generalized equilibrium problems in Hilbert spaces (Q5033377) (← links)
- An adaptive analog of Nesterov's method for variational inequalities with a strongly monotone operator (Q5043019) (← links)
- New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
- New First-Order Algorithms for Stochastic Variational Inequalities (Q5051379) (← links)
- A Novel Algorithm with Self-adaptive Technique for Solving Variational Inequalities in Banach Spaces (Q5054158) (← links)
- (Q5054626) (← links)
- Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem (Q5055085) (← links)
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems (Q5058382) (← links)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
- Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
- Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method (Q5089720) (← links)
