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