Pages that link to "Item:Q2785250"

The following pages link to A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^* (Q2785250):

Displaying 32 items.

• ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES (Q2919313) (← links)
• A new duality theory for mathematical programming (Q3112511) (← links)
• (Q3388755) (← 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)
• An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems (Q3465236) (← links)
• A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm (Q3577847) (← links)
• A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities (Q4405948) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
• Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework (Q4657707) (← links)
• Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities (Q4675964) (← links)
• (Q4995610) (← links)
• The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
• Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods (Q5058404) (← links)
• Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
• Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
• A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance (Q5107962) (← links)
• Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
• On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm (Q5151507) (← links)
• Nonlinear Forward-Backward Splitting with Projection Correction (Q5152477) (← links)
• Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367) (← links)
• A class of nonlinear proximal point algorithms for variational inequality problems (Q5266138) (← links)
• A new incremental constraint projection method for solving monotone variational inequalities (Q5268933) (← links)
• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
• An inexact method of partial inverses and a parallel bundle method (Q5475281) (← links)
• Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
• A partially inexact ADMM with <i>o</i>(1/<i>n</i>) asymptotic convergence rate, 𝒪(1/<i>n</i>) complexity, and immediate relative error tolerance (Q5860817) (← links)
• A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization (Q6051171) (← links)
• Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
• The geometry of monotone operator splitting methods (Q6598417) (← links)