Pages that link to "Item:Q3337229"

The following pages link to A descent algorithm for nonsmooth convex optimization (Q3337229):

Displaying 47 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• Penalty-proximal methods in convex programming (Q1091267) (← links)
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← 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)
• 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)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
• A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• Multivariate spectral gradient algorithm for nonsmooth convex optimization problems (Q1664763) (← 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 quasi-second-order proximal bundle algorithm (Q1915808) (← 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)
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
• Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• A modified conjugate gradient method for general convex functions (Q2699981) (← links)
• A method for nonsmooth optimization problems (Q3154803) (← links)
• A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884) (← links)
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Minimizing and stationary sequences of convex constrained minimization problems (Q5958080) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)