Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Convex analysis and minimization algorithms / Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal
| Convex analysis and minimization algorithms / Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal |
| Autore | Hiriart-Urruty, Jean-Baptiste |
| Pubbl/distr/stampa | Berlin [etc.] : Springer, c1993 |
| Descrizione fisica | v. ; 25 cm. |
| Disciplina | 515.88 |
| Altri autori (Persone) | Lemaréchal, Claude |
| Collana | Grundlehren der mathematischen Wissenschaften |
| Soggetto topico | Funzioni convesse |
| ISBN |
3-540-56850-6
3-540-56852-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Vol. 1.: Fundamentals. - XVII, 417 p. Vol. 2.: Advanced theory and bundle methods. - XVII, 346 p. |
| Record Nr. | UNIBAS-000015524 |
Hiriart-Urruty, Jean-Baptiste
|
||
| Berlin [etc.] : Springer, c1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. della Basilicata | ||
| ||
Convex functions / A. Wayne Roberts, Dale E. Varbegr
| Convex functions / A. Wayne Roberts, Dale E. Varbegr |
| Autore | Roberts, A. Wayne |
| Pubbl/distr/stampa | New York [etc.] : Academic Press, 1973 |
| Descrizione fisica | XX, 300 p. : ill. ; 24 cm. |
| Disciplina | 515.88 |
| Altri autori (Persone) | Varbegrv, Dale E. |
| Collana | Pure and applied mathematics, a series of monographs and textbooks |
| Soggetto topico | Funzioni convesse |
| ISBN | 0-12-589740-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNIBAS-000011635 |
|
Roberts, A. Wayne
|
||
| New York [etc.] : Academic Press, 1973 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. della Basilicata | ||
| ||
Convex functions / [by] A. Wayne Roberts [and] Dale E. Varberg
| Convex functions / [by] A. Wayne Roberts [and] Dale E. Varberg |
| Autore | Roberts, Arthur Wayne |
| Pubbl/distr/stampa | New York ; London : Academic Press, 1973 |
| Descrizione fisica | xx, 300 p. : ill. ; 24 cm |
| Disciplina | 515.88 |
| Altri autori (Persone) | Varberg, Dale E. |
| Collana | Pure and applied mathematics. A series of monographs & textbooks [Academic Press], 0079-8169 ; 57 |
| Soggetto topico | Convex functions |
| ISBN | 0125897405 |
| Classificazione | LC QA331.5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003258959707536 |
|
Roberts, Arthur Wayne
|
||
| New York ; London : Academic Press, 1973 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Convexity and well-posed problems / Roberto Lucchetti
| Convexity and well-posed problems / Roberto Lucchetti |
| Autore | Lucchetti, Roberto |
| Pubbl/distr/stampa | New York : Springer, 2006 |
| Descrizione fisica | xiv, 305 p. ; 25 cm |
| Disciplina | 515.88 |
| Collana | CMS books in mathematics |
| Soggetto topico | Funzioni convesse |
| ISBN |
0387287191
9780387287195 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002260809707536 |
|
Lucchetti, Roberto
|
||
| New York : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Fréchet differentiability of Lipschitz functions and porous sets in Banach spaces / Joram Lindenstrauss, David Preiss, Jaroslav Tiser
| Fréchet differentiability of Lipschitz functions and porous sets in Banach spaces / Joram Lindenstrauss, David Preiss, Jaroslav Tiser |
| Autore | Lindenstrauss, Joram |
| Pubbl/distr/stampa | Princeton : Princeton University Press, c2012 |
| Descrizione fisica | ix, 425 p. ; 25 cm |
| Disciplina | 515.88 |
| Altri autori (Persone) |
Preiss, Davidauthor
Tiser, Jaroslavauthor |
| Collana | Annals of mathematics studies ; 179 |
| Soggetto topico |
Banach spaces
Fréchet spaces Lipschitz spaces Calculus of variations Functional analysis |
| ISBN | 9780691153568 |
| Classificazione |
AMS 26A24
AMS 28A15 LC QA322.2L564 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001807929707536 |
|
Lindenstrauss, Joram
|
||
| Princeton : Princeton University Press, c2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Sobolev spaces / Robert A. Adams and John J. F. Fournier
| Sobolev spaces / Robert A. Adams and John J. F. Fournier |
| Autore | Adams, Robert Alexander |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Amsterdam : Academic Press, 2003 |
| Descrizione fisica | xiii, 305 p. : ill. ; 24 cm |
| Disciplina | 515.88 |
| Altri autori (Persone) | Fournier, John J. F. |
| Collana | Pure and applied mathematics. A series of monographs and textbooks, [Academic press] 0079-8169 ; 140 |
| Soggetto topico | Sobolev spaces |
| ISBN | 0120441438 |
| Classificazione |
AMS 46E35
LC QA323.A43 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003329399707536 |
|
Adams, Robert Alexander
|
||
| Amsterdam : Academic Press, 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Sobolev spaces / Robert A. Adams
| Sobolev spaces / Robert A. Adams |
| Autore | Adams, Robert Alexander |
| Pubbl/distr/stampa | New York : Academic Press, 1975 |
| Descrizione fisica | xviii, 268 p. : ill. ; 24 cm |
| Disciplina | 515.88 |
| Collana | Pure and applied mathematics. A series of monographs & textbooks [Academic Press], 0079-8169 ; 65 |
| Soggetto topico |
Sobolev spaces
Summability and bases |
| ISBN | 0120441500 |
| Classificazione | AMS 46A35 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001352309707536 |
|
Adams, Robert Alexander
|
||
| New York : Academic Press, 1975 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Undergraduate convexity [[electronic resource] ] : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen
| Undergraduate convexity [[electronic resource] ] : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen |
| Autore | Lauritzen Niels <1964-> |
| Pubbl/distr/stampa | Singapore, : World Scientific, 2013 |
| Descrizione fisica | 1 online resource (300 p.) |
| Disciplina | 515.88 |
| Soggetto topico |
Convex domains
Algebras, linear |
| Soggetto genere / forma | Electronic books. |
| ISBN | 981-4412-52-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Acknowledgments; Contents; 1. Fourier-Motzkin elimination; 1.1 Linear inequalities; 1.2 Linear optimization using elimination; 1.3 Polyhedra; 1.4 Exercises; 2. Affine subspaces; 2.1 Definition and basics; 2.2 The affine hull; 2.3 Affine subspaces and subspaces; 2.4 Affine independence and the dimension of a subset; 2.5 Exercises; 3. Convex subsets; 3.1 Basics; Minkowski sum, dilation and the polar of a subset; 3.2 The convex hull; 3.3 Faces of convex subsets; Interlude: Integral points in convex subsets; 3.4 Convex cones; The recession cone; Finitely generated cones
3.5 Carathéodory's theorem3.6 The convex hull, simplicial subsets and Bland's rule; Non-cycling; 3.7 Exercises; 4. Polyhedra; 4.1 Faces of polyhedra; 4.2 Extreme points and linear optimization; 4.3 Weyl's theorem; 4.4 Farkas's lemma; 4.5 Three applications of Farkas's lemma; 4.5.1 Markov chains and steady states; 4.5.2 Gordan's theorem; 4.5.3 Duality in linear programming; 4.6 Minkowski's theorem; 4.7 Parametrization of polyhedra; 4.8 Doubly stochastic matrices: The Birkhoff polytope; 4.8.1 Perfect pairings and doubly stochastic matrices; 4.9 Exercises; 5. Computations with polyhedra 5.1 Extreme rays and minimal generators in convex cones5.2 Minimal generators of a polyhedral cone; 5.3 The double description method; 5.3.1 Converting from half space to vertex representation; 5.3.2 Converting from vertex to half space representation; 5.3.3 Computing the convex hull; 5.4 Linear programming and the simplex algorithm; 5.4.1 Two examples of linear programs; 5.4.2 The simplex algorithm in a special case; 5.4.3 The simplex algorithm for polyhedra in general form; 5.4.4 The simplicial hack; 5.4.5 The computational miracle of the simplex tableau; The simplex algorithm Explaining the steps5.4.6 Computing a vertex in a polyhedron; 5.5 Exercises; 6. Closed convex subsets and separating hyperplanes; 6.1 Closed convex subsets; 6.2 Supporting hyperplanes; 6.3 Separation by hyperplanes; 6.4 Exercises; 7. Convex functions; 7.1 Basics; 7.2 Jensen's inequality; 7.3 Minima of convex functions; 7.4 Convex functions of one variable; 7.5 Differentiable functions of one variable; 7.5.1 The Newton-Raphson method for finding roots; 7.5.2 Critical points and extrema; 7.6 Taylor polynomials; 7.7 Differentiable convex functions; 7.8 Exercises 8. Differentiable functions of several variables8.1 Differentiability; 8.1.1 The Newton-Raphson method for several variables; 8.1.2 Local extrema for functions of several variables; 8.2 The chain rule; 8.3 Lagrange multipliers; The two variable case; The general case and the Lagrangian; 8.4 The arithmetic-geometric inequality revisited; 8.5 Exercises; 9. Convex functions of several variables; 9.1 Subgradients; 9.2 Convexity and the Hessian; 9.3 Positive definite and positive semidefinite matrices; 9.4 Principal minors and definite matrices; 9.5 The positive semidefinite cone 9.6 Reduction of symmetric matrices |
| Record Nr. | UNINA-9910462802103321 |
|
Lauritzen Niels <1964->
|
||
| Singapore, : World Scientific, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Undergraduate convexity [[electronic resource] ] : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen
| Undergraduate convexity [[electronic resource] ] : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen |
| Autore | Lauritzen Niels <1964-> |
| Pubbl/distr/stampa | Singapore, : World Scientific, 2013 |
| Descrizione fisica | 1 online resource (300 p.) |
| Disciplina | 515.88 |
| Soggetto topico |
Convex domains
Algebras, linear |
| ISBN | 981-4412-52-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Acknowledgments; Contents; 1. Fourier-Motzkin elimination; 1.1 Linear inequalities; 1.2 Linear optimization using elimination; 1.3 Polyhedra; 1.4 Exercises; 2. Affine subspaces; 2.1 Definition and basics; 2.2 The affine hull; 2.3 Affine subspaces and subspaces; 2.4 Affine independence and the dimension of a subset; 2.5 Exercises; 3. Convex subsets; 3.1 Basics; Minkowski sum, dilation and the polar of a subset; 3.2 The convex hull; 3.3 Faces of convex subsets; Interlude: Integral points in convex subsets; 3.4 Convex cones; The recession cone; Finitely generated cones
3.5 Carathéodory's theorem3.6 The convex hull, simplicial subsets and Bland's rule; Non-cycling; 3.7 Exercises; 4. Polyhedra; 4.1 Faces of polyhedra; 4.2 Extreme points and linear optimization; 4.3 Weyl's theorem; 4.4 Farkas's lemma; 4.5 Three applications of Farkas's lemma; 4.5.1 Markov chains and steady states; 4.5.2 Gordan's theorem; 4.5.3 Duality in linear programming; 4.6 Minkowski's theorem; 4.7 Parametrization of polyhedra; 4.8 Doubly stochastic matrices: The Birkhoff polytope; 4.8.1 Perfect pairings and doubly stochastic matrices; 4.9 Exercises; 5. Computations with polyhedra 5.1 Extreme rays and minimal generators in convex cones5.2 Minimal generators of a polyhedral cone; 5.3 The double description method; 5.3.1 Converting from half space to vertex representation; 5.3.2 Converting from vertex to half space representation; 5.3.3 Computing the convex hull; 5.4 Linear programming and the simplex algorithm; 5.4.1 Two examples of linear programs; 5.4.2 The simplex algorithm in a special case; 5.4.3 The simplex algorithm for polyhedra in general form; 5.4.4 The simplicial hack; 5.4.5 The computational miracle of the simplex tableau; The simplex algorithm Explaining the steps5.4.6 Computing a vertex in a polyhedron; 5.5 Exercises; 6. Closed convex subsets and separating hyperplanes; 6.1 Closed convex subsets; 6.2 Supporting hyperplanes; 6.3 Separation by hyperplanes; 6.4 Exercises; 7. Convex functions; 7.1 Basics; 7.2 Jensen's inequality; 7.3 Minima of convex functions; 7.4 Convex functions of one variable; 7.5 Differentiable functions of one variable; 7.5.1 The Newton-Raphson method for finding roots; 7.5.2 Critical points and extrema; 7.6 Taylor polynomials; 7.7 Differentiable convex functions; 7.8 Exercises 8. Differentiable functions of several variables8.1 Differentiability; 8.1.1 The Newton-Raphson method for several variables; 8.1.2 Local extrema for functions of several variables; 8.2 The chain rule; 8.3 Lagrange multipliers; The two variable case; The general case and the Lagrangian; 8.4 The arithmetic-geometric inequality revisited; 8.5 Exercises; 9. Convex functions of several variables; 9.1 Subgradients; 9.2 Convexity and the Hessian; 9.3 Positive definite and positive semidefinite matrices; 9.4 Principal minors and definite matrices; 9.5 The positive semidefinite cone 9.6 Reduction of symmetric matrices |
| Record Nr. | UNINA-9910786967903321 |
|
Lauritzen Niels <1964->
|
||
| Singapore, : World Scientific, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Undergraduate convexity : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen
| Undergraduate convexity : from Fourier and Motzkin to Kuhn and Tucker / / Niels Lauritzen |
| Autore | Lauritzen Niels <1964-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Singapore, : World Scientific, 2013 |
| Descrizione fisica | 1 online resource (300 p.) |
| Disciplina | 515.88 |
| Soggetto topico |
Convex domains
Algebras, linear |
| ISBN | 981-4412-52-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Acknowledgments; Contents; 1. Fourier-Motzkin elimination; 1.1 Linear inequalities; 1.2 Linear optimization using elimination; 1.3 Polyhedra; 1.4 Exercises; 2. Affine subspaces; 2.1 Definition and basics; 2.2 The affine hull; 2.3 Affine subspaces and subspaces; 2.4 Affine independence and the dimension of a subset; 2.5 Exercises; 3. Convex subsets; 3.1 Basics; Minkowski sum, dilation and the polar of a subset; 3.2 The convex hull; 3.3 Faces of convex subsets; Interlude: Integral points in convex subsets; 3.4 Convex cones; The recession cone; Finitely generated cones
3.5 Carathéodory's theorem3.6 The convex hull, simplicial subsets and Bland's rule; Non-cycling; 3.7 Exercises; 4. Polyhedra; 4.1 Faces of polyhedra; 4.2 Extreme points and linear optimization; 4.3 Weyl's theorem; 4.4 Farkas's lemma; 4.5 Three applications of Farkas's lemma; 4.5.1 Markov chains and steady states; 4.5.2 Gordan's theorem; 4.5.3 Duality in linear programming; 4.6 Minkowski's theorem; 4.7 Parametrization of polyhedra; 4.8 Doubly stochastic matrices: The Birkhoff polytope; 4.8.1 Perfect pairings and doubly stochastic matrices; 4.9 Exercises; 5. Computations with polyhedra 5.1 Extreme rays and minimal generators in convex cones5.2 Minimal generators of a polyhedral cone; 5.3 The double description method; 5.3.1 Converting from half space to vertex representation; 5.3.2 Converting from vertex to half space representation; 5.3.3 Computing the convex hull; 5.4 Linear programming and the simplex algorithm; 5.4.1 Two examples of linear programs; 5.4.2 The simplex algorithm in a special case; 5.4.3 The simplex algorithm for polyhedra in general form; 5.4.4 The simplicial hack; 5.4.5 The computational miracle of the simplex tableau; The simplex algorithm Explaining the steps5.4.6 Computing a vertex in a polyhedron; 5.5 Exercises; 6. Closed convex subsets and separating hyperplanes; 6.1 Closed convex subsets; 6.2 Supporting hyperplanes; 6.3 Separation by hyperplanes; 6.4 Exercises; 7. Convex functions; 7.1 Basics; 7.2 Jensen's inequality; 7.3 Minima of convex functions; 7.4 Convex functions of one variable; 7.5 Differentiable functions of one variable; 7.5.1 The Newton-Raphson method for finding roots; 7.5.2 Critical points and extrema; 7.6 Taylor polynomials; 7.7 Differentiable convex functions; 7.8 Exercises 8. Differentiable functions of several variables8.1 Differentiability; 8.1.1 The Newton-Raphson method for several variables; 8.1.2 Local extrema for functions of several variables; 8.2 The chain rule; 8.3 Lagrange multipliers; The two variable case; The general case and the Lagrangian; 8.4 The arithmetic-geometric inequality revisited; 8.5 Exercises; 9. Convex functions of several variables; 9.1 Subgradients; 9.2 Convexity and the Hessian; 9.3 Positive definite and positive semidefinite matrices; 9.4 Principal minors and definite matrices; 9.5 The positive semidefinite cone 9.6 Reduction of symmetric matrices |
| Record Nr. | UNINA-9910820519603321 |
|
Lauritzen Niels <1964->
|
||
| Singapore, : World Scientific, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||