Narrow your search

Library

KU Leuven (2)

UGent (2)

ULiège (2)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UAntwerpen (1)

UCLouvain (1)

UCLL (1)

More...

Resource type

book (2)


Language

English (2)


Year
From To Submit

2009 (1)

1971 (1)

Listing 1 - 2 of 2
Sort by

Book
On group-theoretic decision problems and their classification
Author:
ISBN: 0691080917 1400881781 9780691080918 Year: 1971 Volume: 68 Publisher: Princeton (N.J.): Princeton university press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Part exposition and part presentation of new results, this monograph deals with that area of mathematics which has both combinatorial group theory and mathematical logic in common. Its main topics are the word problem for groups, the conjugacy problem for groups, and the isomorphism problem for groups. The presentation depends on previous results of J. L. Britton, which, with other factual background, are treated in detail.

Keywords

Group theory --- 510.6 --- Mathematical logic --- 510.6 Mathematical logic --- Group theory. --- Logic, Symbolic and mathematical. --- Groupes, Théorie des --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Abelian group. --- Betti number. --- Characteristic function (probability theory). --- Characterization (mathematics). --- Combinatorial group theory. --- Conjecture. --- Conjugacy class. --- Conjugacy problem. --- Contradiction. --- Corollary. --- Cyclic permutation. --- Decision problem. --- Diffeomorphism. --- Direct product. --- Direct proof. --- Effective method. --- Elementary class. --- Embedding. --- Enumeration. --- Epimorphism. --- Equation. --- Equivalence relation. --- Exact sequence. --- Existential quantification. --- Finite group. --- Finite set. --- Finitely generated group. --- Finitely presented. --- Free group. --- Free product. --- Fundamental group. --- Fundamental theorem. --- Group (mathematics). --- Gödel numbering. --- Homomorphism. --- Homotopy. --- Inner automorphism. --- Markov property. --- Mathematical logic. --- Mathematical proof. --- Mathematics. --- Monograph. --- Natural number. --- Nilpotent group. --- Normal subgroup. --- Notation. --- Permutation. --- Polycyclic group. --- Presentation of a group. --- Quotient group. --- Recursive set. --- Requirement. --- Residually finite group. --- Semigroup. --- Simple set. --- Simplicial complex. --- Solvable group. --- Statistical hypothesis testing. --- Subgroup. --- Theorem. --- Theory. --- Topology. --- Transitive relation. --- Triviality (mathematics). --- Truth table. --- Turing degree. --- Turing machine. --- Without loss of generality. --- Word problem (mathematics). --- Groupes, Théorie des --- Décidabilité (logique mathématique)


Book
Robust optimization
Authors: --- ---
ISBN: 1282259288 9786612259289 1400831059 0691143684 9780691143682 9781400831050 9781282259287 6612259280 Year: 2009 Publisher: Princeton, NJ : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Keywords

Robust optimization. --- Linear programming. --- 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 --- Robust optimization --- Linear programming --- Optimisation robuste --- Programmation linéaire --- Optimization, Robust --- RO (Robust optimization) --- Mathematical optimization --- Production scheduling --- Programming (Mathematics) --- 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.

Listing 1 - 2 of 2
Sort by