Keyword: gradient search

Found 9 papers in total
A feasible SQP‐GS algorithm for nonconvex, nonsmooth constrained optimization
A feasible SQP‐GS algorithm for nonconvex, nonsmooth constrained optimization
2014,
The gradient sampling (GS) algorithm for minimizing a nonconvex, nonsmooth function...
A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
2013,
In order to propose a scaled conjugate gradient method, the memoryless BFGS...
Using inexact gradients in a multilevel optimization algorithm
Using inexact gradients in a multilevel optimization algorithm
2013,
Many optimization algorithms require gradients of the model functions, but computing...
A derivative‐free approximate gradient sampling algorithm for finite minimax problems
A derivative‐free approximate gradient sampling algorithm for finite minimax problems
2013,
In this paper we present a derivative‐free optimization algorithm for finite...
Linear convergence analysis of the use of gradient projection methods on total variation problems
Linear convergence analysis of the use of gradient projection methods on total variation problems
2013,
Optimization problems using total variation frequently appear in image analysis...
A feasible direction method for image restoration
A feasible direction method for image restoration
2012,
In this work, a feasible direction method is proposed for computing the regularized...
Lagrangean decompositions for the unconstrained binary quadratic programming problem
Lagrangean decompositions for the unconstrained binary quadratic programming problem
2011,
The unconstrained binary quadratic programming problem (QP) is a classical non-linear...
An improved multi‐step gradient‐type method for large scale optimization
An improved multi‐step gradient‐type method for large scale optimization
2011,
In this paper, we propose an improved multi‐step diagonal updating method for...
A coordinate gradient descent method for ℓ 1‐regularized convex minimization
A coordinate gradient descent method for ℓ 1‐regularized convex minimization
2011,
In applications such as signal processing and statistics, many problems involve...
Papers per page: