• # CG_DESCENT

• Referenced in 81 articles [sw04813]
• Algorithm 851: CG_DESCENT. A conjugate gradient method with guaranteed descent Recently, a new nonlinear ... gradient scheme was developed which satisfies the descent condition gTkdk ≤ −7/8 ‖gk‖2 and which ... article studies the convergence behavior of the algorithm; extensive numerical tests and comparisons with other...
• # Pegasos

• Referenced in 67 articles [sw08752]
• simple and effective stochastic sub-gradient descent algorithm for solving the optimization problem cast ... contrast, previous analyses of stochastic gradient descent methods for SVMs require Ω(1/ϵ2) iterations ... size of the training set, the resulting algorithm is especially suited for learning from large...
• # mboost

• Referenced in 48 articles [sw07331]
• mboost: Model-Based Boosting. Functional gradient descent algorithm (boosting) for optimizing general risk functions utilizing...
• # SGD-QN

• Referenced in 15 articles [sw19411]
• algorithm is a stochastic gradient descent algorithm that makes careful use of second-order information ... gradient descent but requires less iterations to achieve the same accuracy. This algorithm...
• # levmar

• Referenced in 43 articles [sw04809]
• variants are included. The Levenberg-Marquardt (LM) algorithm is an iterative technique that finds ... thought of as a combination of steepest descent and the Gauss-Newton method. When ... correct one, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge...
• # sparsenet

• Referenced in 52 articles [sw19133]
• package SparseNet: coordinate descent with nonconvex penalties. We address the problem of sparse selection ... convex-relaxation algorithms for finding good solutions. We pursue a coordinate-descent approach for optimization ... standardizing reparametrization that assists our pathwise algorithm. The MC+ penalty is ideally suited to this...
• # QICD

• Referenced in 5 articles [sw19679]
• Extremely fast algorithm ”QICD”, Iterative Coordinate Descent Algorithm for High-dimensional Nonconvex Penalized Quantile Regression ... This algorithm combines the coordinate descent algorithm in the inner iteration with the majorization minimization...
• # APPLE

• Referenced in 4 articles [sw13354]
• variable selection and parameter estimation. A new algorithm, APPLE, is proposed for calculating the Approximate ... predictor-corrector method and the coordinate-descent algorithm. APPLE is compared with several well-known...
• # GOP

• Referenced in 5 articles [sw17432]
• implemented for various particular core optimization algorithms: Steepest Descent, Heavy-Ball, Genetic Algorithm, Differential Evolution...
• # cvplogistic

• Referenced in 3 articles [sw29394]
• Model using Majorization Minimization by Coordinate Descent (MMCD) Algorithm. The package uses majorization minimization ... coordinate descent (MMCD) algorithm to compute the solution surface for concave penalized logistic regression model...
• # ChainSAT

• Referenced in 6 articles [sw09444]
• Circumspect descent prevails in solving random constraint satisfaction problems. We study the performance of stochastic ... local search algorithms for random instances of the K-satisfiability (K-SAT) problem. We present...
• # topopt_multi

• Referenced in 7 articles [sw25723]
• regularized projected steepest descent method. A new computational algorithm is introduced in the present study ... functional by a fractional step projected steepest descent method. In the first step ... found based on the projected steepest descent method to ensure the reduction in the objective ... control constraints. The presented algorithm could be accounted as a constrained $H^1$ optimization algorithm...