Choose an application

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

Nonlinear programming --- Linear programming --- dataverwerking --- lineaire programmering --- 519.85 --- 681.3*G16 --- Programming (Mathematics) --- Production scheduling --- 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 --- Mathematical programming

Choose an application

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

Certains livres sur les algorithmes sont rigoureux mais incomplets; d’autres couvrent des masses de matériel mais manquent de rigueur. Introduction aux algorithmes combine de manière unique rigueur et exhaustivité. Le livre couvre un large éventail d’algorithmes en profondeur, tout en rendant leur conception et leur analyse accessibles à tous les niveaux de lecteurs. Chaque chapitre est relativement autonome et peut être utilisé comme unité d’étude. Les algorithmes sont décrits en anglais et dans un pseudocode conçu pour être lisible par quiconque a fait un peu de programmation. Les explications ont été maintenues élémentaires sans sacrifier la profondeur de la couverture ou la rigueur mathématique.

Computer science --- Computer programming --- Computer algorithms --- Programmation (Informatique) --- Algorithmes --- Computer programming. --- Computer algorithms. --- algoritmen --- programmeren --- 681.3*F2 --- 519.85 --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Mathematical programming --- 519.85 Mathematical programming --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Algorithms --- Programming --- Algoritmos --- Programación de computadoras --- Libros electrónicos --- Estructura de Datos y Algoritmos II (40152203) --- Lógica y Algorítmica (40151101) --- Bibliografía recomendada --- Discrete mathematics --- Programmeren --- Wiskunde ; computerondersteund --- Programmation informatique --- Algorithme

Choose an application

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

Dynamic programming and stochastic control

Dynamic programming. --- Stochastic control theory. --- Operations Research --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Stochastic processes. --- Random processes --- Probabilities --- Mathematical optimization --- Programming (Mathematics) --- Systems engineering --- Dynamic programming --- Stochastic control theory --- 519.85 --- 519.8 --- 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.8 Operational research --- Operational research --- 519.85 Mathematical programming --- Mathematical programming --- Control theory --- Stochastic processes --- Programmation dynamique --- Processus stochastiques --- ELSEVIER-B EPUB-LIV-FT --- Markov, Processus de --- Theorie du controle --- Programmation mathematique --- Controle stochastique

Choose an application

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

Discrete Optimization I

Discrete programmering. --- Optimaliseren. --- Mathematical optimization. --- Optimisation mathématique --- Mathematical optimization --- 519.85 --- 681.3*F22 --- 681.3*G16 --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Mathematical programming --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 519.85 Mathematical programming --- Operational research. Game theory --- Mathematical analysis. --- 517.1 Mathematical analysis --- Programmation mathematique --- Colloque

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)