Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

1

COAP
2016

favoriteEmaildiscussreport

70views more COAP 2016»

On the steepest descent algorithm for quadratic functions

8 years 26 days ago

On the steepest descent algorithm for quadratic functions

Download www.optimization-online.org

The steepest descent algorithm with exact line searches (Cauchy algorithm) is ineﬃcient, generating oscillating step lengths and a sequence of points converging to the span of the eigenvectors associated with the extreme eigenvalues. The performance becomes very good if a short step is taken at every (say) 10 iterations. We show a new method for estimating short steps, and propose a method alternating Cauchy and short steps. Finally, we use the roots of a certain Chebyshev polynomial to further accelerate the method.

Clóvis C. Gonzaga, Ruana M. Schneider

Real-time Traffic

COAP 2016 |

claim paper

Related Content

» Adaptive optimisation of noisy blackbox functions inherent in microscopic models

» Parametric dictionary learning using steepest descent

» A Steepest Descent Relocation Algorithm for Placement of Sinks in a Sensor Network

» Distributed Control by Lagrangian Steepest Descent

» A new Spiceoriented frequencydomain optimization technique

» Synthesisfortestability using transformations

» A New Rotation Search for Dependent RateDistortion Optimization in Video Coding

» A Study of Evaluation Functions for the Graph KColoring Problem

» Blind source separation based on selforganizing neural network

» MultiTask Learning of Gaussian Graphical Models

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	COAP
Authors	Clóvis C. Gonzaga, Ruana M. Schneider

Comments (0)