Asymptotic Convergence Analysis of the Proximal Point Algorithm
From MaRDI portal
Publication:3316099
DOI10.1137/0322019zbMath0533.49028OpenAlexW2160068964MaRDI QIDQ3316099
Publication date: 1984
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0322019
Convex programming (90C25) Numerical methods involving duality (49M29) Controllability (93B05) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Methods of successive quadratic programming type (90C55) Numerical methods in optimal control (49M99)
Related Items (82)
Some recent advances in projection-type methods for variational inequalities ⋮ Application of the dual active set algorithm to quadratic network optimization ⋮ On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Proximal point method and elliptic regularization ⋮ Coupling proximal methods and variational convergence ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Error bounds in mathematical programming ⋮ An investigation on semismooth Newton based augmented Lagrangian method for image restoration ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ A framework for analyzing local convergence properties with applications to proximal-point algorithms ⋮ On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems ⋮ Weak sharp solutions for variational inequalities in Banach spaces ⋮ Multi-step-prox-regularization method for solving convex variation problems ⋮ FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming ⋮ Yosida-regularization based differential equation approach to generalized equations with applications to nonlinear convex programming ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications ⋮ On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds ⋮ 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 ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ 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 ⋮ A proximal point algorithm for the monotone second-order cone complementarity problem ⋮ A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems ⋮ A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems ⋮ An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation ⋮ An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming ⋮ Finite convergence of a projected proximal point algorithm for the generalized variational inequalities ⋮ New results in the theory of multivalued mappings. I: Topological characteristics and solvability of operator relations ⋮ Finite termination of the proximal point algorithm in Banach spaces ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ Convergence of the augmented decomposition algorithm ⋮ Finite convergence of the proximal point algorithm for variational inequality problems ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion ⋮ The proximal point algorithm revisited ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ On the convergence of the exponential multiplier method for convex programming ⋮ An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators ⋮ Primal-dual proximal point algorithm for linearly constrained convex programming problems ⋮ Modified proximal point algorithm for extended linear-quadratic programming ⋮ Self-adaptive inexact proximal point methods ⋮ A new relative error criterion for the proximal point algorithm ⋮ Convergence analysis of inexact proximal point algorithms on Hadamard manifolds ⋮ Weak convergence of an extended splitting method for monotone inclusions ⋮ Rate of convergence for proximal point algorithms on Hadamard manifolds ⋮ Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity ⋮ Robustness of the hybrid extragradient proximal-point algorithm. ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ 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 ⋮ An efficient Hessian based algorithm for singly linearly and box constrained least squares regression ⋮ Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite 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 ⋮ A projection method for least-squares solutions to overdetermined systems of linear inequalities ⋮ Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem ⋮ On convergence of the proximal point algorithm in Banach spaces ⋮ An extension of Luque's growth condition ⋮ Metric subregularity and the proximal point method ⋮ An accelerated differential equation system for generalized equations ⋮ A proximal approach to the inversion of ill-conditioned matrices ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming ⋮ An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications ⋮ Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination ⋮ On finite convergence of proximal point algorithms for variational inequalities ⋮ Dual active sets and constrained optimization ⋮ Applications of the method of partial inverses to convex programming: Decomposition ⋮ Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector ⋮ On a primal-dual Newton proximal method for convex quadratic programs ⋮ Proximal Gradient Methods for Machine Learning and Imaging
This page was built for publication: Asymptotic Convergence Analysis of the Proximal Point Algorithm
