Finite termination of the proximal point algorithm
From MaRDI portal
Publication:1176570
DOI10.1007/BF01594944zbMath0741.90051MaRDI QIDQ1176570
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Some recent advances in projection-type methods for variational inequalities, Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities, On applications of the calmness moduli for multifunctions to error bounds, A characterization of the optimal set of linear programs based on the augmented lagrangian, Proximal methods avoid active strict saddles of weakly convex functions, Combined relaxation method for mixed equilibrium problems, Partial Smoothness and Constant Rank, Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, A proximal point algorithm for minimax problems, On finite termination of an inexact proximal point algorithm, Weak sharp solutions for variational inequalities in Banach spaces, Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, Linear conditioning, weak sharpness and finite convergence for equilibrium problems, From error bounds to the complexity of first-order descent methods for convex functions, Computing proximal points of convex functions with inexact subgradients, New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, On the variational behaviour of functions with positive steepest descent rate, Generalized weak sharp minima in cone-constrained convex optimization with applications, Weak sharp solutions for nonsmooth variational inequalities, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, Convergence of a proximal point algorithm for solving minimization problems, Optimality, identifiability, and sensitivity, Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity, 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, A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence, Finite convergence of the proximal point algorithm for variational inequality problems, Finite termination of inexact proximal point algorithms in Hilbert spaces, Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem, Minimum principle sufficiency, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Global convergence and finite termination of a class of smooth penalty function algorithms, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping, On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems, Generic Minimizing Behavior in Semialgebraic Optimization, Double-regularization proximal methods, with complementarity applications, Robustness of the hybrid extragradient proximal-point algorithm., Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, A note on finite termination of iterative algorithms in mathematical programming, Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces, A proximal point-type method for multicriteria optimization, Faster subgradient methods for functions with Hölderian growth, Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms, Error bounds for nondegenerate monotone linear complementarity problems, On convergence of the proximal point algorithm in Banach spaces, Moduli of regularity and rates of convergence for Fejér monotone sequences, A general iterative method for variational inequality problems, mixed equilibrium problems, and fixed point problems of strictly pseudocontractive mappings in Hilbert spaces, Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions, Some aspects of nonsmooth variational inequalities on Hadamard manifolds, Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings, Finite termination of the proximal point method for convex functions on Hadamard manifolds, On the finite termination of the gradient projection method, Convergence rates of subgradient methods for quasi-convex optimization problems, Active‐Set Newton Methods and Partial Smoothness, On finite convergence of proximal point algorithms for variational inequalities, Remarks to an equivalent formulation of ekeland’s variational principle, The adventures of a simple algorithm, Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates, A unified description of iterative algorithms for traffic equilibria
Cites Work
