The following pages link to (Q4704621):
Displaying 50 items.
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems (Q2191802) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- Projective splitting methods for sums of maximal monotone operators with applications (Q2257570) (← links)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (Q2301141) (← links)
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis (Q2317847) (← links)
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions (Q2322832) (← links)
- Two strong convergence theorems for the common null point problem in Banach spaces (Q2337361) (← links)
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations (Q2345688) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems (Q2436689) (← links)
- An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds (Q2450734) (← links)
- An inexact proximal-type algorithm in Banach spaces (Q2465461) (← links)
- A family of projective splitting methods for the sum of two maximal monotone operators (Q2467160) (← links)
- A new generalized APPA for maximal monotone operators (Q2469710) (← links)
- New proximal algorithms for a class of \((A, \eta)\)-accretive variational inclusion problems with non-accretive set-valued mappings (Q2471334) (← links)
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems (Q2497398) (← links)
- Projection iterative method for solving general variational inequalities (Q2511123) (← links)
- Inexact proximal point algorithms and descent methods in optimization (Q2575251) (← links)
- Uniformity and inexact version of a proximal method for metrically regular mappings (Q2642106) (← links)
- On the application of the SCD semismooth* Newton method to variational inequalities of the second kind (Q2677669) (← links)
- Proximal algorithm for solving monotone variational inclusion (Q3177629) (← 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)
- Strict convex regularizations, proximal points and augmented lagrangians (Q4528235) (← links)
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
- A proximal-Newton method for unconstrained convex optimization in Hilbert spaces (Q4639119) (← links)
- On the proximal point method for an infinite family of equilibrium problems in Banach spaces (Q4968680) (← 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)
- A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance (Q5107962) (← links)
- Proximal Point Method for Quasi-Equilibrium Problems in Banach Spaces (Q5119589) (← links)
- The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion (Q5149515) (← links)
- Nonlinear Forward-Backward Splitting with Projection Correction (Q5152477) (← links)
- An Alternating Direction Method of Multipliers for Optimal Control Problems Constrained with Elliptic Equations (Q5156950) (← links)
- Augmented Lagrangian methods for variational inequality problems (Q5189878) (← links)
- Stability analysis of Gauss-type proximal point method for metrically regular mappings (Q5193271) (← links)
- Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367) (← links)
- Convergence Rates for Projective Splitting (Q5231693) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds (Q5506692) (← links)
- Approximate first-order primal-dual algorithms for saddle point problems (Q5856742) (← 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 new accuracy criterion for approximate proximal point algorithms (Q5955039) (← links)
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization (Q6051171) (← links)
- A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations (Q6064041) (← links)
- Approximate customized proximal point algorithms for separable convex optimization (Q6155528) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective (Q6497048) (← links)
