Robust Optimization / / Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.

Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of r...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2009]
©2009
Year of Publication:2009
Edition:Course Book
Language:English
Series:Princeton Series in Applied Mathematics ; 28
Online Access:
Physical Description:1 online resource (576 p.) :; 36 line illus. 41 tables.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9781400831050
ctrlnum (DE-B1597)447001
(OCoLC)979757917
collection bib_alma
record_format marc
spelling Ben-Tal, Aharon, author. aut http://id.loc.gov/vocabulary/relators/aut
Robust Optimization / Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.
Course Book
Princeton, NJ : Princeton University Press, [2009]
©2009
1 online resource (576 p.) : 36 line illus. 41 tables.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Princeton Series in Applied Mathematics ; 28
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
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)
Linear programming.
Robust optimization.
MATHEMATICS / Linear & Nonlinear Programming. bisacsh
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 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.
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.
El Ghaoui, Laurent, author. aut http://id.loc.gov/vocabulary/relators/aut
Nemirovski, Arkadi, author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package 9783110515831 ZDB-23-PAM
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502
print 9780691143682
https://doi.org/10.1515/9781400831050
https://www.degruyter.com/isbn/9781400831050
Cover https://www.degruyter.com/document/cover/isbn/9781400831050/original
language English
format eBook
author Ben-Tal, Aharon,
Ben-Tal, Aharon,
El Ghaoui, Laurent,
Nemirovski, Arkadi,
spellingShingle Ben-Tal, Aharon,
Ben-Tal, Aharon,
El Ghaoui, Laurent,
Nemirovski, Arkadi,
Robust Optimization /
Princeton Series in Applied Mathematics ;
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
author_facet Ben-Tal, Aharon,
Ben-Tal, Aharon,
El Ghaoui, Laurent,
Nemirovski, Arkadi,
El Ghaoui, Laurent,
El Ghaoui, Laurent,
Nemirovski, Arkadi,
Nemirovski, Arkadi,
author_variant a b t abt
a b t abt
g l e gl gle
a n an
author_role VerfasserIn
VerfasserIn
VerfasserIn
VerfasserIn
author2 El Ghaoui, Laurent,
El Ghaoui, Laurent,
Nemirovski, Arkadi,
Nemirovski, Arkadi,
author2_variant g l e gl gle
a n an
author2_role VerfasserIn
VerfasserIn
VerfasserIn
VerfasserIn
author_sort Ben-Tal, Aharon,
title Robust Optimization /
title_full Robust Optimization / Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.
title_fullStr Robust Optimization / Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.
title_full_unstemmed Robust Optimization / Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.
title_auth Robust Optimization /
title_alt 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
title_new Robust Optimization /
title_sort robust optimization /
series Princeton Series in Applied Mathematics ;
series2 Princeton Series in Applied Mathematics ;
publisher Princeton University Press,
publishDate 2009
physical 1 online resource (576 p.) : 36 line illus. 41 tables.
Issued also in print.
edition Course Book
contents 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
isbn 9781400831050
9783110515831
9783110442502
9780691143682
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA402
callnumber-sort QA 3402.5 B445 42009EB
url https://doi.org/10.1515/9781400831050
https://www.degruyter.com/isbn/9781400831050
https://www.degruyter.com/document/cover/isbn/9781400831050/original
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.6
dewey-sort 3519.6
dewey-raw 519.6
dewey-search 519.6
doi_str_mv 10.1515/9781400831050
oclc_num 979757917
work_keys_str_mv AT bentalaharon robustoptimization
AT elghaouilaurent robustoptimization
AT nemirovskiarkadi robustoptimization
status_str n
ids_txt_mv (DE-B1597)447001
(OCoLC)979757917
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
is_hierarchy_title Robust Optimization /
container_title Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
author2_original_writing_str_mv noLinkedField
noLinkedField
noLinkedField
noLinkedField
_version_ 1770176644310368256
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09407nam a22019695i 4500</leader><controlfield tag="001">9781400831050</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20092009nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400831050</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400831050</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)447001</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979757917</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA402.5</subfield><subfield code="b">.B445 2009eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT017000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.6</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143265:</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Tal, Aharon, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust Optimization /</subfield><subfield code="c">Aharon Ben-Tal, Arkadi Nemirovski, Laurent El Ghaoui.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2009]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (576 p.) :</subfield><subfield code="b">36 line illus. 41 tables.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Series in Applied Mathematics ;</subfield><subfield code="v">28</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Part I. Robust Linear Optimization -- </subfield><subfield code="t">Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- </subfield><subfield code="t">Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- </subfield><subfield code="t">Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- </subfield><subfield code="t">Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- </subfield><subfield code="t">Part II. Robust Conic Optimization -- </subfield><subfield code="t">Chapter Five. Uncertain Conic Optimization: The Concepts -- </subfield><subfield code="t">Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- </subfield><subfield code="t">Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- </subfield><subfield code="t">Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- </subfield><subfield code="t">Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- </subfield><subfield code="t">Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- </subfield><subfield code="t">Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- </subfield><subfield code="t">Chapter Twelve. Robust Classi¯cation and Estimation -- </subfield><subfield code="t">Part III. Robust Multi-Stage Optimization -- </subfield><subfield code="t">Chapter Thirteen. Robust Markov Decision Processes -- </subfield><subfield code="t">Chapter Fourteen. Robust Adjustable Multistage Optimization -- </subfield><subfield code="t">Part IV. Selected Applications -- </subfield><subfield code="t">Chapter Fifteen. Selected Applications -- </subfield><subfield code="t">Appendix A: Notation and Prerequisites -- </subfield><subfield code="t">Appendix B: Some Auxiliary Proofs -- </subfield><subfield code="t">Appendix C: Solutions to Selected Exercises -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Linear programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Robust optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Linear &amp; Nonlinear Programming.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">0O.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Accuracy and precision.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Additive model.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Almost surely.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Best, worst and average case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bifurcation theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Big O notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Candidate solution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Central limit theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chaos theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Coefficient.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational complexity theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Constrained optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex hull.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cumulative distribution function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Curse of dimensionality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Decision problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Decision rule.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Degeneracy (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagram (category theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Duality (optimization).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dynamic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Exponential function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Feasible region.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Floor and ceiling functions.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">For All Practical Purposes.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Free product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ideal solution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Identity matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Inequality (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Infimum and supremum.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Integer programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Law of large numbers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Likelihood-ratio test.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear dynamical system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear inequality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear map.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear matrix inequality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear regression.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Loss function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Margin classifier.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov chain.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov decision process.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Max-plus algebra.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Maxima and minima.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Multivariate normal distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-hardness.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Norm (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Normal distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimal control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Orientability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">P versus NP problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pairwise.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parametric family.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Proportionality (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Relative interior.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robust control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robust decision-making.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robust optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Semi-infinite.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sensitivity analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simple set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Singular value.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Skew-symmetric matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Slack variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spherical model.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spline (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">State variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic calculus.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Strong duality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Support vector machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Time complexity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Uncertainty.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Uniform distribution (discrete).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Unimodality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Upper and lower bounds.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Virtual displacement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Weak duality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Wiener filter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">With high probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Without loss of generality.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">El Ghaoui, Laurent, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nemirovski, Arkadi, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Series in Applied Mathematics eBook-Package</subfield><subfield code="z">9783110515831</subfield><subfield code="o">ZDB-23-PAM</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691143682</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400831050</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400831050</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400831050/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PAM</subfield></datafield></record></collection>