Asymptotic Convergence Analysis of the Proximal Point Algorithm
From MaRDI portal
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods involving duality (49M29) Numerical methods in optimal control (49M99) Numerical solutions to equations with nonlinear operators (65J15) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Controllability (93B05)
Recommendations
Cited in
(only showing first 100 items - show all)- An extension of Luque's growth condition
- Metric subregularity and the proximal point method
- A proximal approach to the inversion of ill-conditioned matrices
- Asymptotic regularity and the strong convergence of the proximal point algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Modified proximal point algorithm for extended linear-quadratic programming
- Progressive regularization of variational inequalities and decomposition algorithms
- Proximal methods in view of interior-point strategies
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- Dual active sets and constrained optimization
- The perturbed proximal point algorithm and some of its applications
- Error bounds in mathematical programming
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- Convergence of the augmented decomposition algorithm
- Rate of convergence for proximal point algorithms on Hadamard manifolds
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Some recent advances in projection-type methods for variational inequalities
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
- Weak convergence of an extended splitting method for monotone inclusions
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- An accelerated differential equation system for generalized equations
- On a primal-dual Newton proximal method for convex quadratic programs
- A survey on some recent developments of alternating direction method of multipliers
- Augmented Lagrangian methods for convex matrix optimization problems
- An investigation on semismooth Newton based augmented Lagrangian method for image restoration
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- The proximal point algorithm revisited
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Application of the dual active set algorithm to quadratic network optimization
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Self-adaptive inexact proximal point methods
- A new relative error criterion for the proximal point algorithm
- A variable metric proximal-descent algorithm for monotone operators
- On finite convergence of proximal point algorithms for variational inequalities
- Yosida-regularization based differential equation approach to generalized equations with applications to nonlinear convex programming
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm
- An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- scientific article; zbMATH DE number 4133840 (Why is no real title available?)
- On convergence of the proximal point algorithm in Banach spaces
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Applications of the method of partial inverses to convex programming: Decomposition
- scientific article; zbMATH DE number 3982414 (Why is no real title available?)
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- scientific article; zbMATH DE number 4125198 (Why is no real title available?)
- Coupling proximal methods and variational convergence
- A proximal point algorithm for the monotone second-order cone complementarity problem
- scientific article; zbMATH DE number 1062747 (Why is no real title available?)
- An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators
- Some remarks on the proximal point algorithm
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- NUMERICAL APPROACH TO A STATIONARY SOLUTION OF A SECOND ORDER DISSIPATIVE DYNAMICAL SYSTEM
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- scientific article; zbMATH DE number 1569001 (Why is no real title available?)
- Multi-step-prox-regularization method for solving convex variation problems
- Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm
- Finite convergence of the proximal point algorithm for variational inequality problems
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- An inexact augmented Lagrangian method for second-order cone programming with applications
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- Proximal Gradient Methods for Machine Learning and Imaging
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- scientific article; zbMATH DE number 5586189 (Why is no real title available?)
- Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination
- scientific article; zbMATH DE number 2214513 (Why is no real title available?)
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- scientific article; zbMATH DE number 7483223 (Why is no real title available?)
- Robustness of the hybrid extragradient proximal-point algorithm.
- Weak sharp solutions for variational inequalities in Banach spaces
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- Generalizations of the proximal method of multipliers in convex optimization
- Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
- Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions
- Finite termination of the proximal point algorithm in Banach spaces
- Parallel synchronous algorithm for nonlinear fixed point problems
- Convergence properties of gradient-based methods for minimax problems with nonlinear constraints
- A fully relaxed Tseng's splitting method
- Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
- Global convergence analysis of the power proximal point and augmented Lagrangian method
This page was built for publication: Asymptotic Convergence Analysis of the Proximal Point Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316099)
