Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This compact book, through the simplifying perspective it presents, will take a reader who knows little of interior-point methods to within sight of the research frontier, developing key ideas that were over a decade in the making by numerous interior-point method researchers. It aims at developing a thorough understanding of the most general theory for interior-point methods, a class of algorithms for convex optimization problems. The study of these algorithms has dominated the continuous optimization literature for nearly 15 years. In that time, the theory has matured tremendously, but much of the literature is difficult to understand, even for specialists. By focusing only on essential elements of the theory and emphasizing the underlying geometry, A Mathematical View of Interior-Point Methods in Convex Optimization makes the theory accessible to a wide audience, allowing them to quickly develop a fundamental understanding of the material.

Interior-point methods. --- Mathematical optimization. --- Convex programming.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Sensitivity theory (Mathematics). --- Interior-point methods. --- Mathematical optimization. --- Numerical analysis.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming (Mathematics) --- Convex programming --- Interior-point methods --- #TELE:SISTA --- Convex programming. --- Interior-point methods. --- Programmation (mathématiques) --- Calcul des variations --- Programmation mathematique --- Programmation convexe

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Linear Optimization (LO) is one of the most widely applied and taught techniques in mathematics, with applications in many areas of science, commerce and industry. The dramatically increased interest in the subject is due mainly to advances in computer technology and the development of Interior Point Methods (IPMs) for LO. This book provides a unified presentation of the field. The authors present a self-contained comprehensive interior point approach to both the theory of LO and algorithms for LO (design, convergence, complexity, asymptotic behaviour and computational issues). A common thread throughout the book is the role of strictly complementary solutions, which play a crucial role in the interior point approach and distinguishes the new approach from the classical Simplex-based approach. The approach to LO in this book is new in many aspects. In particular the IPM and self-dual model based development of duality theory is surprisingly elegant. The algorithmic part of this book contains a complete discussion of many algorithmic variants, including predictor-corrector methods, partial updating, higher order methods and sensitivity and parametric analysis. The comprehensive coverage of the subject, together with the clarity of presentation, ensures that this book will be an invaluable resource for researchers and professionals who wish to develop their understanding of LO and IPMs. Numerous exercises are provided to help consolidate understanding of the material and more than 45 figures are included to illustrate the characteristics of the algorithms. A general understanding of linear algebra and calculus is assumed. The first chapters provide a self-contained introduction to LO for readers who are unfamiliar with LO methods; however these chapters are also of interest for others who want to have a fresh look at the topic. Audience This book is intended for the optimization researcher community, advanced undergraduate and graduate students who are interested to learn the fundamentals and major variants of Interior Point Methods for linear optimization, who want to have a comprehensive introduction to Interior Point Methods that revolutionized the theory and practice of modern optimization.

Linear programming. --- Interior-point methods. --- Mathematical optimization. --- Algorithms. --- Algorism --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematics. --- Computer mathematics. --- Operations research. --- Management science. --- Optimization. --- Operations Research, Management Science. --- Computational Science and Engineering. --- Algebra --- Arithmetic --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Foundations --- Programming (Mathematics) --- Production scheduling --- Computer science. --- Informatics --- Science --- Computer mathematics --- Electronic data processing --- Mathematics --- Quantitative business analysis --- Management --- Problem solving --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Research on interior-point methods (IPMs) has dominated the field of mathematical programming for the last two decades. Two contrasting approaches in the analysis and implementation of IPMs are the so-called small-update and large-update methods, although, until now, there has been a notorious gap between the theory and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function. The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs. Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work.

Interior-point methods. --- Mathematical optimization. --- Programming (Mathematics). --- Mathematical optimization --- Interior-point methods --- Programming (Mathematics) --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Operations Research --- Mathematical programming --- Goal programming --- Algorithms --- Functional equations --- Operations research --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Simulation methods --- System analysis --- 519.85 --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.85 Mathematical programming --- 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. --- 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. --- Mathematical Optimization --- Mathematics --- Programming (mathematics)