Matrices, moments, and quadrature with applications [[electronic resource] /] / Gene H. Golub and Gerard Meurant |
Autore | Golub Gene H (Gene Howard), <1932-2007.> |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, c2010 |
Descrizione fisica | 1 online resource (376 p.) |
Disciplina | 512.9434 |
Altri autori (Persone) | MeurantGérard A |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Matrices
Numerical analysis |
Soggetto non controllato |
Algorithm
Analysis of algorithms Analytic function Asymptotic analysis Basis (linear algebra) Basis function Biconjugate gradient method Bidiagonal matrix Bilinear form Calculation Characteristic polynomial Chebyshev polynomials Coefficient Complex number Computation Condition number Conjugate gradient method Conjugate transpose Cross-validation (statistics) Curve fitting Degeneracy (mathematics) Determinant Diagonal matrix Dimension (vector space) Eigenvalues and eigenvectors Equation Estimation Estimator Exponential function Factorization Function (mathematics) Function of a real variable Functional analysis Gaussian quadrature Hankel matrix Hermite interpolation Hessenberg matrix Hilbert matrix Holomorphic function Identity matrix Interlacing (bitmaps) Inverse iteration Inverse problem Invertible matrix Iteration Iterative method Jacobi matrix Krylov subspace Laguerre polynomials Lanczos algorithm Linear differential equation Linear regression Linear subspace Logarithm Machine epsilon Matrix function Matrix polynomial Maxima and minima Mean value theorem Meromorphic function Moment (mathematics) Moment matrix Moment problem Monic polynomial Monomial Monotonic function Newton's method Numerical analysis Numerical integration Numerical linear algebra Orthogonal basis Orthogonal matrix Orthogonal polynomials Orthogonal transformation Orthogonality Orthogonalization Orthonormal basis Partial fraction decomposition Polynomial Preconditioner QR algorithm QR decomposition Quadratic form Rate of convergence Recurrence relation Regularization (mathematics) Rotation matrix Singular value Square (algebra) Summation Symmetric matrix Theorem Tikhonov regularization Trace (linear algebra) Triangular matrix Tridiagonal matrix Upper and lower bounds Variable (mathematics) Vector space Weight function |
ISBN |
1-282-45801-9
1-282-93607-7 9786612458019 1-4008-3388-4 |
Classificazione | SK 915 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- PART 1. Theory -- Chapter 1. Introduction -- Chapter 2. Orthogonal Polynomials -- Chapter 3. Properties of Tridiagonal Matrices -- Chapter 4. The Lanczos and Conjugate Gradient Algorithms -- Chapter 5. Computation of the Jacobi Matrices -- Chapter 6. Gauss Quadrature -- Chapter 7. Bounds for Bilinear Forms uTƒ(A)v -- Chapter 8. Extensions to Nonsymmetric Matrices -- Chapter 9. Solving Secular Equations -- PART 2. Applications -- Chapter 10. Examples of Gauss Quadrature Rules -- Chapter 11. Bounds and Estimates for Elements of Functions of Matrices -- Chapter 12. Estimates of Norms of Errors in the Conjugate Gradient Algorithm -- Chapter 13. Least Squares Problems -- Chapter 14. Total Least Squares -- Chapter 15. Discrete Ill-Posed Problems -- Bibliography -- Index |
Record Nr. | UNINA-9910780861503321 |
Golub Gene H (Gene Howard), <1932-2007.> | ||
Princeton, N.J., : Princeton University Press, c2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski |
Autore | Ben-Tal A |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, c2009 |
Descrizione fisica | 1 online resource (565 p.) |
Disciplina | 519.6 |
Altri autori (Persone) |
El GhaouiLaurent
NemirovskiĭArkadiĭ Semenovich |
Collana | Princeton Series in Applied Mathematics |
Soggetto topico |
Robust optimization
Linear programming |
Soggetto non controllato |
0O
Accuracy and precision Additive model Almost surely Approximation algorithm Approximation Best, worst and average case Bifurcation theory Big O notation Candidate solution Central limit theorem Chaos theory Coefficient Computational complexity theory Constrained optimization Convex hull Convex optimization Convex set Cumulative distribution function Curse of dimensionality Decision problem Decision rule Degeneracy (mathematics) Diagram (category theory) Duality (optimization) Dynamic programming Exponential function Feasible region Floor and ceiling functions For All Practical Purposes Free product Ideal solution Identity matrix Inequality (mathematics) Infimum and supremum Integer programming Law of large numbers Likelihood-ratio test Linear dynamical system Linear inequality Linear map Linear matrix inequality Linear programming Linear regression Loss function Margin classifier Markov chain Markov decision process Mathematical optimization Max-plus algebra Maxima and minima Multivariate normal distribution NP-hardness Norm (mathematics) Normal distribution Optimal control Optimization problem Orientability P versus NP problem Pairwise Parameter Parametric family Probability distribution Probability Proportionality (mathematics) Quantity Random variable Relative interior Robust control Robust decision-making Robust optimization Semi-infinite Sensitivity analysis Simple set Singular value Skew-symmetric matrix Slack variable Special case Spherical model Spline (mathematics) State variable Stochastic calculus Stochastic control Stochastic optimization Stochastic programming Stochastic Strong duality Support vector machine Theorem Time complexity Uncertainty Uniform distribution (discrete) Unimodality Upper and lower bounds Variable (mathematics) Virtual displacement Weak duality Wiener filter With high probability Without loss of generality |
ISBN |
1-282-25928-8
9786612259289 1-4008-3105-9 |
Classificazione | SK 870 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- Part I. Robust Linear Optimization -- Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- Part II. Robust Conic Optimization -- Chapter Five. Uncertain Conic Optimization: The Concepts -- Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- Chapter Twelve. Robust Classi¯cation and Estimation -- Part III. Robust Multi-Stage Optimization -- Chapter Thirteen. Robust Markov Decision Processes -- Chapter Fourteen. Robust Adjustable Multistage Optimization -- Part IV. Selected Applications -- Chapter Fifteen. Selected Applications -- Appendix A: Notation and Prerequisites -- Appendix B: Some Auxiliary Proofs -- Appendix C: Solutions to Selected Exercises -- Bibliography -- Index |
Record Nr. | UNINA-9910778219003321 |
Ben-Tal A | ||
Princeton, NJ, : Princeton University Press, c2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky |
Autore | Peng Jiming |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2009] |
Descrizione fisica | 1 online resource (201 p.) |
Disciplina | 519.6 |
Collana | Princeton Series in Applied Mathematics |
Soggetto topico |
Interior-point methods
Mathematical optimization Programming (Mathematics) Civil & Environmental Engineering Engineering & Applied Sciences Operations Research |
Soggetto non controllato |
Accuracy and precision
Algorithm Analysis of algorithms Analytic function Associative property Barrier function Binary number Block matrix Combination Combinatorial optimization Combinatorics Complexity Conic optimization Continuous optimization Control theory Convex optimization Delft University of Technology Derivative Differentiable function Directional derivative Division by zero Dual space Duality (mathematics) Duality gap Eigenvalues and eigenvectors Embedding Equation Estimation Existential quantification Explanation Feasible region Filter design Function (mathematics) Implementation Instance (computer science) Invertible matrix Iteration Jacobian matrix and determinant Jordan algebra Karmarkar's algorithm Karush–Kuhn–Tucker conditions Line search Linear complementarity problem Linear function Linear programming Lipschitz continuity Local convergence Loss function Mathematical optimization Mathematician Mathematics Matrix function McMaster University Monograph Multiplication operator Newton's method Nonlinear programming Nonlinear system Notation Operations research Optimal control Optimization problem Parameter (computer programming) Parameter Pattern recognition Polyhedron Polynomial Positive semidefinite Positive-definite matrix Quadratic function Requirement Result Scientific notation Second derivative Self-concordant function Sensitivity analysis Sign (mathematics) Signal processing Simplex algorithm Simultaneous equations Singular value Smoothness Solution set Solver Special case Subset Suggestion Technical report Theorem Theory Time complexity Two-dimensional space Upper and lower bounds Variable (computer science) Variable (mathematics) Variational inequality Variational principle Without loss of generality Worst-case complexity Yurii Nesterov |
ISBN |
1-282-08760-6
9786612087608 1-4008-2513-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- Acknowledgments -- Notation -- List of Abbreviations -- Chapter 1. Introduction and Preliminaries -- Chapter 2. Self-Regular Functions and Their Properties -- Chapter 3. Primal-Dual Algorithms for Linear Optimization Based on Self-Regular Proximities -- Chapter 4. Interior-Point Methods for Complementarity Problems Based on Self- Regular Proximities -- Chapter 5. Primal-Dual Interior-Point Methods for Semidefinite Optimization Based on Self-Regular Proximities -- Chapter 6. Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities -- Chapter 7. Initialization: Embedding Models for Linear Optimization, Complementarity Problems, Semidefinite Optimization and Second-Order Conic Optimization -- Chapter 8. Conclusions -- References -- Index |
Record Nr. | UNINA-9910777727403321 |
Peng Jiming | ||
Princeton, NJ : , : Princeton University Press, , [2009] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|