WorldCat Identities

Nemirovskiĭ, Arkadiĭ Semenovich

Overview
Works: 36 works in 129 publications in 4 languages and 2,882 library holdings
Genres: Conference papers and proceedings  Handbooks and manuals 
Roles: Author, Other
Publication Timeline
.
Most widely held works by Arkadiĭ Semenovich Nemirovskiĭ
Interior-point polynomial algorithms in convex programming by I︠U︡. E Nesterov( Book )

19 editions published between 1993 and 2001 in English and held by 304 WorldCat member libraries worldwide

Specialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods for linear and quadratic programming, polynomial-time methods for nonlinear convex programming, and efficient computational methods for control problems and variational inequalities. A background in linear algebra and mathematical programming is necessary to understand the book. The detailed proofs and lack of "numerical examples" might suggest that the book is of limited value to the reader interested in the practical aspects of convex optimization, but nothing could be further from the truth. An entire chapter is devoted to potential reduction methods precisely because of their great efficiency in practice
Robust optimization by A Ben-Tal( Book )

18 editions published in 2009 in English and held by 256 WorldCat member libraries worldwide

Robust optimization is a fairly 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. The authors are the principal developers of robust optimization
Lectures on probability theory and statistics : Ecole d'Eté de Probabilités de Saint-Flour XXV - 1995 by Michel Emery( Book )

26 editions published in 2000 in 3 languages and held by 251 WorldCat member libraries worldwide

Annotation
Lectures on modern convex optimization : analysis, algorithms, and engineering applications by A Ben-Tal( Book )

20 editions published in 2001 in English and held by 228 WorldCat member libraries worldwide

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthesis of filters, Lyapunov stability analysis, and structural design. The authors also discuss the complexity issues and provide an overview of the basic theory of state-of-the-art polynomial time interior point methods for linear, conic quadratic, and semidefinite programming. The book's focus on well-structured convex problems in conic form allows for unified theoretical and algorithmical treatment of a wide spectrum of important optimization problems arising in applications
Self-concordant functions and polynomial-time methods in convex programming by I︠U︡. E Nesterov( Book )

2 editions published in 1989 in English and held by 8 WorldCat member libraries worldwide

Složnost' zadač i ėffektivnost' metodov optimizacii by Arkadiĭ Semenovich Nemirovskiĭ( Book )

3 editions published in 1979 in Russian and Undetermined and held by 8 WorldCat member libraries worldwide

Acceleration of the path-following method for optimization over the cone of positive semidefinite matrices = Accélération de la méthode du suivi de chemin pour l'optimisation dans le cône des matrices semi-définies positives by I︠U︡. E Nesterov( Book )

4 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide

Abstract: "The paper is devoted to acceleration of the path- following interior point polyomial [sic] time method for optimization over the cone of positive semidefinite matrices, with applications to quadratically constrained problems and extensions onto the general self- concordant case. In particular, we demonstrate that in a problem involving m of general type [mu] x [mu] Linear Matrix Inequalities with n [> or =] [mu] scalar control variables the Conjugate-Gradient-based acceleration allows to reduce the arithmetic cost of an [epsilon]-solution by a factor of order of max[n[superscript 1/3][mu][superscript -1/6], n[superscript 1/5]]; for the Karmarkar-type acceleration this factor is of order of min[n, m[superscript 1/2]. The Conjugate-Gradient-Based acceleration turns out to be efficient also in the case of several specific 'structured' problems coming from applications in Control and Graph Theory."
Matematicheskie metody optimizat︠s︡ii ustroĭstv i algoritmov ASU by D. B I︠U︡din( Book )

2 editions published in 1982 in Russian and held by 4 WorldCat member libraries worldwide

On estimation of non-smooth functionals by Oleg V Lepskij( Book )

2 editions published in 1996 in English and held by 3 WorldCat member libraries worldwide

Central path and Riemannian distances by IU. E Nesterov( Book )

2 editions published in 2003 in English and held by 3 WorldCat member libraries worldwide

Linear minimax regret estimation with bounded data uncertainties by Yonina C Eldar( Book )

3 editions published in 2003 in English and held by 3 WorldCat member libraries worldwide

Cascading an approach to robust material optimization by Michal Kočvara( Book )

2 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide

On estimation of non-smooth functionals( )

1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide

Sparse non Gaussian component analysis by semidefinite programming( )

1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide

Sparse non-Gaussian component analysis (SNGCA) is an unsupervised method of extracting a linear structure from a high dimensional data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach to direct estimation of the projector on the target space based on semidefinite programming which improves the method sensitivity to a broad variety of deviations from normality. We also discuss the procedures which allows to recover the structure when its effective dimension is unknown. -- dimension reduction ; non-Gaussian components analysis ; feature extraction
New variants of bundle methods = Nouvelles variantes des methodes de faisceaux by Claude Lemaréchal( Book )

1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide

Abstract: "In this paper, we study bundle-type methods for convex optimization, based on successive approximations of the optimal value. They enjoy optimal efficiency estimates; furthermore, they provide attractive alternatives to solving convex constrained optimization problems, convex-concave saddle-point problems, and variational inequalities. We present a number of possible variants, establish their efficiency estimate, and give some illustrative numerical results."
Cone-free primal-dual path-following and potential reduction polynomial time interior-point methods by Arkadiĭ Semenovich Nemirovskiĭ( Book )

1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide

Remote Tropospheric Radio Communication( Book )

2 editions published in 1980 in Undetermined and English and held by 2 WorldCat member libraries worldwide

LMI control toolbox for use with MATLAB by Inc MathWorks( Book )

2 editions published in 1995 in English and held by 2 WorldCat member libraries worldwide

Dialogovaia sistema analiza mnogokriterial nykh zadach "Disamz."( Book )

1 edition published in 1988 in Russian and held by 1 WorldCat member library worldwide

Robust modeling of multi-stage portfolio problems by A Ben-Tal( )

1 edition published in 2000 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.56 (from 0.06 for Robust opt ... to 0.99 for Robust mod ...)

Lectures on probability theory and statistics : Ecole d'Eté de Probabilités de Saint-Flour XXV - 1995
Alternative Names
Arkadi Nemirovski Amerikaans wiskundige

Arkadi Nemirovski israelischer Mathematiker

Arkadi Nemirovski Mathematician

Nemiroski Arkadi 1947-....

Nemirovski, A.

Nemirovski, A. 1947-

Nemirovski, Arkadi.

Nemirovski, Arkadi 1947-

Nemirovski Arkadi Semenovitch 1947-....

Nemirovskiĭ, A. S.

Nemirovskiĭ, A.S. 1947-

Nemirovskiĭ, A. S. (Arkadiĭ Semenovich)

Nemirovskii, Arkadii.

Nemirovskiĭ, Arkadiĭ 1947-...

Nemirovskiĭ, Arkadiĭ Semenovich

Nemirovskiĭ, Arkadiĭ Semenovich 1947-...

Nemirovskij, A.S.

Nemirovskij, A. S. 1947-

Nemirovskij, Arkadij N. 1947-

Nemirovskij, Arkadij Semenovič 1947-

Nemirovskij, Arkadij SemenoviÏc 1947-

Nemirovsky, A.S.

Nemirovsky, A. S. 1947-

Nemirovsky, Arkadii S. 1947-

Nemirovsky, Arkadii Semenovich

Nemirovsky, Arkadii Semenovich 1947-

Nemiyrwbsqiy ʾArqadiy 1947-....

Немировский, Аркадий Семенович 1947-...

נמירובסקי ארקדי 1947-....

アルカディ・ネミロフスキ

Languages
English (103)

Russian (5)

French (2)

German (1)

Covers
Robust optimizationLectures on probability theory and statistics : Ecole d'Eté de Probabilités de Saint-Flour XXV - 1995Lectures on modern convex optimization : analysis, algorithms, and engineering applications