Pages that link to "Item:Q4726049"

The following pages link to Numerical methods for nondifferentiable convex optimization (Q4726049):

Displaying 50 items.

• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
• A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
• A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
• Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's (Q642609) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• Computing proximal points of nonconvex functions (Q959941) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• Penalty-proximal methods in convex programming (Q1091267) (← links)
• A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
• Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
• Prox-regularization and solution of ill-posed elliptic variational inequalities (Q1265616) (← links)
• The perturbed proximal point algorithm and some of its applications (Q1317307) (← links)
• Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
• Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
• Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
• Convergence of some algorithms for convex minimization (Q1321649) (← links)
• A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
• Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
• Coupling the proximal point algorithm with approximation methods (Q1379933) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
• A family of variable metric proximal methods (Q1804367) (← links)
• A continuation method for monotone variational inequalities (Q1908015) (← links)
• Generalized proximal point algorithm for convex optimization (Q1908641) (← links)
• A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
• Family of perturbation methods for variational inequalities (Q1918010) (← links)
• A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• Theoretical aspect of diagonal Bregman proximal methods (Q2176024) (← links)
• Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
• Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
• Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
• Inexact proximal point algorithms and descent methods in optimization (Q2575251) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• The perturbed Tikhonov's algorithm and some of its applications (Q4698889) (← links)
• About saddle values of a class of convex-concave functions (Q4764855) (← links)
• Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
• Multi-step-prox-regularization method for solving convex variation problems (Q4836771) (← links)
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)
• A memory gradient method for non-smooth convex optimization (Q5266154) (← links)
• A decomposition method for convex minimization problems and its application. (Q5931895) (← links)
• Robustness of the hybrid extragradient proximal-point algorithm. (Q5958079) (← links)
• Minimizing and stationary sequences of convex constrained minimization problems (Q5958080) (← links)
• Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)