Pages that link to "Item:Q1176570"

The following pages link to Finite termination of the proximal point algorithm (Q1176570):

Displaying 50 items.

• Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities (Q276332) (← links)
• On finite convergence of iterative methods for variational inequalities in Hilbert spaces (Q398639) (← links)
• Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
• Optimality, identifiability, and sensitivity (Q463741) (← links)
• Finite convergence of the proximal point algorithm for variational inequality problems (Q491230) (← links)
• Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
• Weak sharp solutions for variational inequalities in Banach spaces (Q601307) (← links)
• New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
• Finite termination of the proximal point algorithm in Banach spaces (Q655479) (← links)
• Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems (Q732657) (← links)
• A proximal point-type method for multicriteria optimization (Q741360) (← links)
• Error bounds for nondegenerate monotone linear complementarity problems (Q753691) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Combined relaxation method for mixed equilibrium problems (Q852111) (← links)
• On the variational behaviour of functions with positive steepest descent rate (Q891928) (← links)
• On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
• A general iterative method for variational inequality problems, mixed equilibrium problems, and fixed point problems of strictly pseudocontractive mappings in Hilbert spaces (Q1035112) (← links)
• Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
• 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 (Q1036657) (← links)
• Minimum principle sufficiency (Q1198327) (← links)
• A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• A proximal point algorithm for minimax problems (Q1371666) (← links)
• Finite convergence of the partial inverse algorithm (Q1379940) (← links)
• New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Weak sharp solutions for nonsmooth variational inequalities (Q1695815) (← links)
• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence (Q1733318) (← links)
• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• Termination of the F5 algorithm (Q2017770) (← links)
• Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces (Q2045138) (← links)
• Some aspects of nonsmooth variational inequalities on Hadamard manifolds (Q2073011) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• The projected polar proximal point algorithm converges globally (Q2162520) (← links)
• On finite termination of an inexact proximal point algorithm (Q2171164) (← links)
• Linear conditioning, weak sharpness and finite convergence for equilibrium problems (Q2176285) (← links)
• Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping (Q2268931) (← links)
• Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
• Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680) (← links)
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
• A note on finite termination of iterative algorithms in mathematical programming (Q2517801) (← links)
• On finite convergence of proximal point algorithms for variational inequalities (Q2573440) (← links)
• Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework (Q2643765) (← links)