Nemirovski arkadi (69 résultats)

hardcover. Etat : Fine.

hardcover. Etat : Very Good. Cover and edges may have some wear.

hardcover. Etat : New. 1st Edition. This is a new book. All orders ship by next business day! We are a small company and very thankful for your business.

Etat : good. This book is in good condition. The cover has minor creases or bends. The binding is tight and pages are intact. Some pages may have writing or highlighting.

Etat : New.

hardcover. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Etat : New.

hardcover. Etat : VeryGood. A copy that may have been read, very minimal wear and tear. May have a remainder mark.

Etat : As New. Unread book in perfect condition.

Hardback. Etat : New. With an emphasis on timeless essential mathematical background for optimization, this textbook provides a comprehensive and accessible introduction to convex optimization for students in applied mathematics, computer science, and engineering. Authored by two influential researchers, the book covers both convex analysis basics and modern topics such as conic programming, conic representations of convex sets, and cone-constrained convex problems, providing readers with a solid, up-to-date understanding of the field. By excluding modeling and algorithms, the authors are able to discuss the theoretical aspects in greater depth. Over 170 in-depth exercises provide hands-on experience with the theory, while more than 30 'Facts' and their accompanying proofs enhance approachability. Instructors will appreciate the appendices that cover all necessary background and the instructors-only solutions manual provided online. By the end of the book, readers will be well equipped to engage with state-of-the-art developments in optimization and its applications in decision-making and engineering.…

Paperback. Etat : New. The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics being expressive abilities of LOgeometry of LO - structure of polyhedral sets, LO duality and its applicationstraditional LO algorithms - primal and dual simplex methods, and network simplex methodpolynomial time solvability of LO via ellipsoid algorithmconic programming with emphasis on expressing abilities of second order and semidefinite optimization, and polynomial time primal-dual interior point algorithms for linear and semidefinite optimization..…

Etat : New.

Etat : New.

hardcover. Etat : Very Good. Very Good. Used with some reading wear but is still in great reading condition. No markings in text.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : As New. Unread book in perfect condition.

Etat : New. In English.

Etat : New.

Paperback. Etat : new. Paperback. The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics being expressive abilities of LOgeometry of LO structure of polyhedral sets, LO duality and its applicationstraditional LO algorithms primal and dual simplex methods, and network simplex methodpolynomial time solvability of LO via ellipsoid algorithmconic programming with emphasis on expressing abilities of second order and semidefinite optimization, and polynomial time primal-dual interior point algorithms for linear and semidefinite optimization.; "A graduate level, rigorous, and self contained introduction to Linear Optimization. Comes with exercises and solutions. Appendices also provide brief summaries of the pre-requisite results for this book"-- Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New.

Hardback. Etat : New. This authoritative book draws on the latest research to explore the interplay of high-dimensional statistics with optimization. Through an accessible analysis of fundamental problems of hypothesis testing and signal recovery, Anatoli Juditsky and Arkadi Nemirovski show how convex optimization theory can be used to devise and analyze near-optimal statistical inferences.Statistical Inference via Convex Optimization is an essential resource for optimization specialists who are new to statistics and its applications, and for data scientists who want to improve their optimization methods. Juditsky and Nemirovski provide the first systematic treatment of the statistical techniques that have arisen from advances in the theory of optimization. They focus on four well-known statistical problems-sparse recovery, hypothesis testing, and recovery from indirect observations of both signals and functions of signals-demonstrating how they can be solved more efficiently as convex optimization problems. The emphasis throughout is on achieving the best possible statistical performance. The construction of inference routines and the quantification of their statistical performance are given by efficient computation rather than by analytical derivation typical of more conventional statistical approaches. In addition to being computation-friendly, the methods described in this book enable practitioners to handle numerous situations too difficult for closed analytical form analysis, such as composite hypothesis testing and signal recovery in inverse problems.Statistical Inference via Convex Optimization features exercises with solutions along with extensive appendixes, making it ideal for use as a graduate text.…

Etat : As New. Unread book in perfect condition.

Hardback. Etat : New. 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.…

Etat : New.