Skip navigation

Bookboon.com Download free eBooks and textbooks

Choose a category

Descent and Interior-point Methods

Convexity and Optimization – Part III

Descent and Interior-point Methods
Not enough reviews yet
ISBN: 978-87-403-1384-0
1 edition
Pages : 146
  • Price: 129.00 kr
  • Price: €13.99
  • Price: £13.99
  • Price: ₹250
  • Price: $13.99
  • Price: 129.00 kr
  • Price: 129.00 kr

Download for FREE in 4 easy steps...

We are terribly sorry, but in order to download our books or watch our videos, you will need a browser that allows JavaScript.
After entering your email address, a confirmation email will be sent to your inbox. Please approve this email to receive our weekly eBook update. We will not share your personal information with any third party.
eLib
Unlock your organization's learning potential
See Demo

Corporate eLibrary

Discover our employee learning solutions

This is a Premium eBook

Bookboon Premium - Gain access to over 800 eBooks - without ads

You can get free access for a month to this - and 800 other books with the Premium Subscription. You can also buy the book below

  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: €5.99 p/m
  • Start a 30-day free trial. After trial: £4.99 p/m
  • Start a 30-day free trial. After trial: ₹299 p/m
  • Start a 30-day free trial. After trial: $3.99 p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
eLib
Unlock your organization's learning potential
Click here!

Corporate eLibrary

Discover our employee learning solutions

About the book

  1. Description
  2. Content

Description

This third and final part of Convexity and Optimization discusses some optimization methods which, when carefully implemented, are efficient numerical optimization algorithms. We begin with a very brief general description of descent methods and then proceed to a detailed study of Newton's method. One chapter is devoted to self-concordant functions, and the convergence rate of Newton's method when applied to self-concordant functions is studied. We conclude by studying of the complexity of LP-problems.

Content

  1. Descent methods
    1. General principles
    2. The gradient descent method
  2. Newton’s method
    1. Newton decrement and Newton direction
    2. Newton’s method
    3. Equality constraints
  3. Self-concordant functions
    1. Self-concordant functions
    2. Closed self-concordant functions
    3. Basic inequalities for the local seminorm
    4. Minimization
    5. Newton’s method for self-concordant functions
  4. The path-following method
    1. Barrier and central path
    2. Path-following methods
    3. The path-following method with self-concordant barrier
    4. Self-concordant barriers
    5. The path-following method
    6. LP problems
    7. Complexity
This website uses cookies to improve user experience. By using our website you consent to all cookies in accordance with EU regulation.