Pages that link to "Item:Q3920554"

The following pages link to A generalized proximal point algorithm for certain non-convex minimization problems (Q3920554):

Displaying 50 items.

• Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
• A new approach to the proximal point method: convergence on general Riemannian manifolds (Q283913) (← links)
• A proximal method for composite minimization (Q304260) (← links)
• New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
• Gradient methods for minimizing composite functions (Q359630) (← links)
• Combined partial regularization and descent method for a generalized primal-dual system (Q360477) (← links)
• Combined methods for dynamic spatial auction market models (Q400025) (← links)
• Interior proximal methods for quasiconvex optimization (Q427358) (← links)
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality (Q494873) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
• Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems (Q1304774) (← links)
• Partial linearization methods in nonlinear programming (Q1321373) (← links)
• Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases (Q1626523) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Two-level iterative method for non-stationary mixed variational inequalities (Q1695323) (← links)
• On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
• Proximal point method for a special class of nonconvex multiobjective optimization functions (Q1744628) (← links)
• Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
• Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
• A parallel descent algorithm for convex programming (Q1908925) (← links)
• The convex geometry of linear inverse problems (Q1928276) (← links)
• Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
• Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
• A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
• Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• Incrementally updated gradient methods for constrained and regularized optimization (Q2251572) (← links)
• A proximal gradient descent method for the extended second-order cone linear complementarity problem (Q2268076) (← links)
• Similarity preserving low-rank representation for enhanced data representation and effective subspace learning (Q2339393) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• Convergence rates analysis of a multiobjective proximal gradient method (Q2688916) (← links)
• Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
• A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
• (Q3388765) (← links)
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization (Q3457189) (← links)
• Sequential threshold control in descent splitting methods for decomposable optimization problems (Q3458841) (← links)
• Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)