Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
From MaRDI portal
Publication:5704069
DOI10.1287/moor.27.1.170.331zbMath1082.90582OpenAlexW2079004067MaRDI QIDQ5704069
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ef6d2b771882873aa481c4b4cc84910d46f711cf
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Variational inequalities (49J40) Programming in abstract spaces (90C48) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
A new approach to the proximal point method: convergence on general Riemannian manifolds, Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces, An algorithmic approach to prox-regular variational inequalities, Local linear convergence for alternating and averaged nonconvex projections, A proximal method for composite minimization, An inexact restoration strategy for the globalization of the sSQP method, Revisit the over-relaxed proximal point algorithm, An inexact proximal method for quasiconvex minimization, Uniformity and inexact version of a proximal method for metrically regular mappings, Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework, Generalized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problems, Augmented Lagrangian methods for convex matrix optimization problems, A framework for analyzing local convergence properties with applications to proximal-point algorithms, Proximal methods in reflexive Banach spaces without monotonicity, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, On Proximal Algorithms with Inertial Effects Beyond Monotonicity, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality, 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, 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, On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions, Full stability of general parametric variational systems, Local linear convergence of approximate projections onto regularized sets, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds, Generalized monotone operators and their averaged resolvents, Logarithmic quasi-distance proximal point scalarization method for multi-objective programming, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, On the difference of two maximal monotone operators: Regularization and algorithmic approaches, Generalized proximal point algorithms for multiobjective optimization problems, The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications, A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework, The proximal point algorithm revisited, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, Self-adaptive inexact proximal point methods, A Lyusternik-Graves theorem for the proximal point method, The over-relaxed \(A\)-proximal point algorithm for general nonlinear mixed set-valued inclusion framework, Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces, Weak convergence of an extended splitting method for monotone inclusions, Asymptotic analysis for proximal-type methods in vector variational inequality problems, Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity, On the proximal point method for equilibrium problems in Hilbert spaces, A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces, Local Monotonicity and Full Stability for Parametric Variational Systems, Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design, On the positive definiteness of limiting coderivative for set-valued mappings, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems, On general over-relaxed proximal point algorithm and applications, Approximation of Fixed Points of Metrically Regular Mappings, The elicited progressive decoupling algorithm: a note on the rate of convergence and a preliminary numerical experiment on the choice of parameters, Metric subregularity and the proximal point method, Radius theorems for monotone mappings, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, Variational convexity and the local monotonicity of subgradient mappings, An extension of the proximal point algorithm beyond convexity, On strongly quasiconvex functions: existence results and proximal point algorithms