Convex Analysis and Minimization Algorithms I: Fundamentals by Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

By Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Convex research might be regarded as a refinement of ordinary calculus, with equalities and approximations changed via inequalities. As such, it may well simply be built-in right into a graduate examine curriculum. Minimization algorithms, extra particularly these tailored to non-differentiable services, supply an instantaneous program of convex research to varied fields on the topic of optimization and operations examine. those themes making up the identify of the booklet, mirror the 2 origins of the authors, who belong respectively to the tutorial global and to that of purposes. half i will be able to be used as an introductory textbook (as a foundation for classes, or for self-study); half II keeps this at the next technical point and is addressed extra to experts, amassing effects that to this point haven't seemed in books.

Show description

Read Online or Download Convex Analysis and Minimization Algorithms I: Fundamentals PDF

Similar linear programming books

Linear Programming and its Applications

Within the pages of this article readers will locate not anything under a unified therapy of linear programming. with out sacrificing mathematical rigor, the most emphasis of the ebook is on versions and purposes. crucial sessions of difficulties are surveyed and awarded through mathematical formulations, through resolution tools and a dialogue of a number of "what-if" eventualities.

Methods of Mathematical Economics: Linear and Nonlinear Programming, Fixed-Point Theorems (Classics in Applied Mathematics, 37)

This article makes an attempt to survey the middle matters in optimization and mathematical economics: linear and nonlinear programming, setting apart aircraft theorems, fixed-point theorems, and a few in their applications.

This textual content covers in basic terms topics good: linear programming and fixed-point theorems. The sections on linear programming are established round deriving tools in accordance with the simplex set of rules in addition to a few of the usual LP difficulties, corresponding to community flows and transportation challenge. I by no means had time to learn the part at the fixed-point theorems, yet i feel it will possibly end up to be important to investigate economists who paintings in microeconomic idea. This part offers 4 diverse proofs of Brouwer fixed-point theorem, an evidence of Kakutani's Fixed-Point Theorem, and concludes with an evidence of Nash's Theorem for n-person video games.

Unfortunately, an important math instruments in use by means of economists this day, nonlinear programming and comparative statics, are slightly pointed out. this article has precisely one 15-page bankruptcy on nonlinear programming. This bankruptcy derives the Kuhn-Tucker stipulations yet says not anything concerning the moment order stipulations or comparative statics results.

Most most probably, the unusual choice and insurance of subject matters (linear programming takes greater than 1/2 the textual content) easily displays the truth that the unique variation got here out in 1980 and in addition that the writer is absolutely an utilized mathematician, no longer an economist. this article is worthy a glance if you'd like to appreciate fixed-point theorems or how the simplex set of rules works and its purposes. glance in other places for nonlinear programming or more moderen advancements in linear programming.

Planning and Scheduling in Manufacturing and Services

This ebook specializes in making plans and scheduling functions. making plans and scheduling are types of decision-making that play a huge position in so much production and providers industries. The making plans and scheduling features in an organization commonly use analytical thoughts and heuristic tips on how to allocate its constrained assets to the actions that experience to be performed.

Optimization with PDE Constraints

This ebook offers a latest advent of pde limited optimization. It presents an exact useful analytic therapy through optimality stipulations and a state of the art, non-smooth algorithmical framework. additionally, new structure-exploiting discrete techniques and massive scale, essentially proper functions are offered.

Extra resources for Convex Analysis and Minimization Algorithms I: Fundamentals

Example text

3. 3) x a number which is certainly not +00. As a result, its opposite f*(s) is in our space of interest R U {+oo}. 2). -----_.. 1. 2) are generally preferable, and will be generally preferred. 4) the geometrical interpretation displayed in Fig. 1: for given s and r, consider the affine function as ,r defined by JR. 2 . Due to the geometry of an epigraph, there are two kinds ofr for givens: those, small enough, such thatas,r ~ I; and those so large that as,r(x) > I(x) for some x. The particular r = f*(s) is their common bound, obtained when the line gr as ,r "leans" on epi f, or supports epi I.

H ~ h Letting h +0, we obtain D+ co f(x) ~ Df(x) = o. Taking h < 0, we show likewise that D_ co f(x) ;;:: Df(x) = o. On the other hand, the convex co f satisfies D_ co f ~ D+ co f: we conclude that D co f (x) = 0, co f has a O-derivative at x, is therefore minimal at x, and f as 0 well.

2); since the function X ~ 1/2kx 2 has the derivative kx, we conclude that I(k) is differentiable, and that I(k) (x) = k[Yk (x) - x]. 5 and Fig. 1. 4 Let {/k} kEN be a sequence ofconvex functions converging pointwise to a (convex) function I and take x E dom I (assumed nonempty). For any 0 sequence Sk E alk(X), the cluster points of{sd are all in a/(x). 5: the limes exterior is the set of all cluster-points). 7): it suffices to pass to the limit in 5 Second-Order Differentiation fk(y) ;;:, fk(x) + Sk(Y - 29 for all Y E lR x) (a technical point is that, since the limit f is finite at x by assumption, then necessarily fk(X) is also finite for k large enough).

Download PDF sample

Rated 4.29 of 5 – based on 49 votes