KIT-Bibliothek
suchen
KIT-Bibliothek
KIT-Bibliothek Medienportal
FAQ Audio-/Videodatei publizieren
Meine Ergebnisse eingrenzen
Art der Mediendatei
Reichweite
Fachgebiet
Publikationsjahr
Typ
Computational Economics WS 2022/23, Teil 12
Computational Economics WS 2022/23, Teil 12
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 8
Computational Economics WS 2022/23, Teil 8
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 7
Computational Economics WS 2022/23, Teil 7
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 5
Computational Economics WS 2022/23, Teil 5
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 4
Computational Economics WS 2022/23, Teil 4
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 10
Computational Economics WS 2022/23, Teil 10
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 9
Computational Economics WS 2022/23, Teil 9
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 6
Computational Economics WS 2022/23, Teil 6
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 3
Computational Economics WS 2022/23, Teil 3
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 2
Computational Economics WS 2022/23, Teil 2
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 11
Computational Economics WS 2022/23, Teil 11
Pradyumn Shukla
Computational Economics WS 2022/23, Teil 1
Computational Economics WS 2022/23, Teil 1
Pradyumn Shukla
Parametric Optimization, Section 2.3.2 (Three regularity conditions)
Parametric Optimization, Section 2.3.2 (Three regularity conditions)
Oliver Stein
Parametric Optimization, Section 2.3.1 (Criticality notions for constrained problems)
Parametric Optimization, Section 2.3.1 (Criticality notions for constrained problems)
Oliver Stein
Parametric Optimization, Section 2.2.3 (Quadratic indices), Section 2.2.4 (Stability of nondegenerate minimal points)
Parametric Optimization, Section 2.2.3 (Quadratic indices), Section 2.2.4 (Stability of nondegenerate minimal points)
Oliver Stein
Parametric Optimization, Section 1.9 (Counter examples)
Parametric Optimization, Section 1.9 (Counter examples)
Oliver Stein
Parametric Optimization, Section 1.3 (Algorithms and a fourth key question), Section 1.4 (Decomposition methods), Section 1.5 (Robust and semi-infinite optimization)
Parametric Optimization, Section 1.3 (Algorithms and a fourth key question), Section 1.4 (Decomposition methods), Section 1.5 (Robust and semi-infinite optimization)
Oliver Stein
Parametric Optimization, Section 1.1 (Shadow prices and three key questions), Section 1.2 (Hotelling's lemma and the same questions)
Parametric Optimization, Section 1.1 (Shadow prices and three key questions), Section 1.2 (Hotelling's lemma and the same questions)
Oliver Stein
Parametric Optimization
Parametric Optimization
Oliver Stein
Parametric Optimization, Section 3.2.2 (Applications and characterizations for semicontinuity properties of functions)
Parametric Optimization, Section 3.2.2 (Applications and characterizations for semicontinuity properties of functions)
Oliver Stein
Parametric Optimization, Section 2.3.7 (Sensitivity of nondegenerate minimal values), part 2
Parametric Optimization, Section 2.3.7 (Sensitivity of nondegenerate minimal values), part 2
Oliver Stein
Parametric Optimization, Section 2.3.5 (Stability of nondegenerate minimal points)
Parametric Optimization, Section 2.3.5 (Stability of nondegenerate minimal points)
Oliver Stein
Parametric Optimization, Section 2.3.7 (Sensitivity of nondegenerate minimal values), part 1
Parametric Optimization, Section 2.3.7 (Sensitivity of nondegenerate minimal values), part 1
Oliver Stein
Parametric Optimization, Section 4.1.3 (Optimality conditions)
Parametric Optimization, Section 4.1.3 (Optimality conditions)
Oliver Stein
Parametric Optimization, Section 4.1.4 (Reduction Ansatz)
Parametric Optimization, Section 4.1.4 (Reduction Ansatz)
Oliver Stein
Parametric Optimization, Section 3.7 (Directional sensitivity of minimal values)
Parametric Optimization, Section 3.7 (Directional sensitivity of minimal values)
Oliver Stein
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 3
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 3
Oliver Stein
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 2
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 2
Oliver Stein
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 1
Global Optimization I, Section 2.8.5 (Frank-Wolfe method), part 1
Oliver Stein
Global Optimization I, Section 2.8.4 (Kelley's cutting plane method), part 1
Global Optimization I, Section 2.8.4 (Kelley's cutting plane method), part 1
Oliver Stein
Global Optimization I, Section 2.8.4 (Kelley's cutting plane method), part 2
Global Optimization I, Section 2.8.4 (Kelley's cutting plane method), part 2
Oliver Stein
Global Optimization I, Section 2.2.1 (Higher-dimensional first derivatives)
Global Optimization I, Section 2.2.1 (Higher-dimensional first derivatives)
Oliver Stein
Global Optimization I, Section 2.1 (Convexity), part 2
Global Optimization I, Section 2.1 (Convexity), part 2
Oliver Stein
Global Optimization I, Section 1.2.4 (Unbounded feasible sets), part 2
Global Optimization I, Section 1.2.4 (Unbounded feasible sets), part 2
Oliver Stein
Global Optimization I, Section 1.2.1 (Definition of solvability)
Global Optimization I, Section 1.2.1 (Definition of solvability)
Oliver Stein
Global Optimization I, Section 2.8 (Numerical methods); Section 2.8.1 (Basic idea of the gradient method)
Global Optimization I, Section 2.8 (Numerical methods); Section 2.8.1 (Basic idea of the gradient method)
Oliver Stein
Global Optimization I, Section 2.7.2 (The KKT conditions)
Global Optimization I, Section 2.7.2 (The KKT conditions)
Oliver Stein
Global Optimization I, Section 2.7.1 (Lagrange- and Wolfe-duality), part 3
Global Optimization I, Section 2.7.1 (Lagrange- and Wolfe-duality), part 3
Oliver Stein
Global Optimization I, Section 2.7.1 (Lagrange- and Wolfe-duality), part 2
Global Optimization I, Section 2.7.1 (Lagrange- and Wolfe-duality), part 2
Oliver Stein
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 3
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 3
Oliver Stein
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 2
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 2
Oliver Stein
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 1
Global Optimization I, Section 2.8.6 (Basic idea of primal-dual IPMs), part 1
Oliver Stein
Global Optimization I, Section 2.8.3 (Basic idea of cutting plane methods)
Global Optimization I, Section 2.8.3 (Basic idea of cutting plane methods)
Oliver Stein
Global Optimization I, Section 2.8.2 (Basic idea of Newton's method)
Global Optimization I, Section 2.8.2 (Basic idea of Newton's method)
Oliver Stein
Global Optimization I, Section 2.7.5 (Constraint Qualifications)
Global Optimization I, Section 2.7.5 (Constraint Qualifications)
Oliver Stein
Parametric Optimization, Section 2.2.2 (Nondegenerate critical points)
Parametric Optimization, Section 2.2.2 (Nondegenerate critical points)
Oliver Stein
Parametric Optimization, Section 2.2.1 (Preliminary thoughts)
Parametric Optimization, Section 2.2.1 (Preliminary thoughts)
Oliver Stein
Parametric Optimization, Section 2.1 (Basic terminology and notation)
Parametric Optimization, Section 2.1 (Basic terminology and notation)
Oliver Stein
Parametric Optimization, Section 1.6 (Bilevel optimization), Section 1.7 (Nash games), Section 1.8 (Multiobjective optimization)
Parametric Optimization, Section 1.6 (Bilevel optimization), Section 1.7 (Nash games), Section 1.8 (Multiobjective optimization)
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.2 (The purely integer case), part 1
Mixed-Integer Optimization I, Section 2.5.2 (The purely integer case), part 1
Oliver Stein
Parametric Optimization, Section 4.2.1 (Nash game definitions and examples)
Parametric Optimization, Section 4.2.1 (Nash game definitions and examples)
Oliver Stein
Parametric Optimization, Section 4.1.2 (Topological properties of the feasible set)
Parametric Optimization, Section 4.1.2 (Topological properties of the feasible set)
Oliver Stein
Parametric Optimization, Section 4.1.1 (SIP examples)
Parametric Optimization, Section 4.1.1 (SIP examples)
Oliver Stein
Parametric Optimization, Section 3.5 (Continuity properties of constrained minimal values), Section 3.6 (Continuity properties of constrained minimal points)
Parametric Optimization, Section 3.5 (Continuity properties of constrained minimal values), Section 3.6 (Continuity properties of constrained minimal points)
Oliver Stein
Parametric Optimization, Section 3.4 (Continuity properties of the feasible set mapping)
Parametric Optimization, Section 3.4 (Continuity properties of the feasible set mapping)
Oliver Stein
Parametric Optimization, Section 3.3.3 (Semicontinuity properties of setvalued mappings)
Parametric Optimization, Section 3.3.3 (Semicontinuity properties of setvalued mappings)
Oliver Stein
Parametric Optimization, Section 3.3.2 (Closedness and local boundedness of unconstrained minimal points)
Parametric Optimization, Section 3.3.2 (Closedness and local boundedness of unconstrained minimal points)
Oliver Stein
Parametric Optimization, Section 3.3.1 (Basic concepts for setvalued mappings)
Parametric Optimization, Section 3.3.1 (Basic concepts for setvalued mappings)
Oliver Stein
Parametric Optimization, Section 3.2.5 (Continuity of unconstrained minimal values)
Parametric Optimization, Section 3.2.5 (Continuity of unconstrained minimal values)
Oliver Stein
Parametric Optimization, Section 3.2.4 (Lower semicontinuity of unconstrained minimal values), part 1
Parametric Optimization, Section 3.2.4 (Lower semicontinuity of unconstrained minimal values), part 1
Oliver Stein
Parametric Optimization, Section 3.2.4 (Lower semicontinuity of minimal values), part 3
Parametric Optimization, Section 3.2.4 (Lower semicontinuity of minimal values), part 3
Oliver Stein
Parametric Optimization, Section 3.2.3 (Upper semicontinuity of unconstrained minimal values)
Parametric Optimization, Section 3.2.3 (Upper semicontinuity of unconstrained minimal values)
Oliver Stein
Parametric Optimization, Section 3.2.1 (Semicontinuity of functions)
Parametric Optimization, Section 3.2.1 (Semicontinuity of functions)
Oliver Stein
Parametric Optimization, Section 3.1 (Preliminary thoughts)
Parametric Optimization, Section 3.1 (Preliminary thoughts)
Oliver Stein
Parametric Optimization, Section 2.3.3 (Nondegenerate critical points), Section 2.3.4 (Linear and quadratic indices)
Parametric Optimization, Section 2.3.3 (Nondegenerate critical points), Section 2.3.4 (Linear and quadratic indices)
Oliver Stein
Parametric Optimization, Section 2.3.6 (Sensitivity of nondegenerate minimal points)
Parametric Optimization, Section 2.3.6 (Sensitivity of nondegenerate minimal points)
Oliver Stein
Parametric Optimization, Section 2.2.6 (Sensitivity of nondegenerate minimal values)
Parametric Optimization, Section 2.2.6 (Sensitivity of nondegenerate minimal values)
Oliver Stein
Parametric Optimization, Section 2.2.5 (Sensitivity of nondegenerate minimal points)
Parametric Optimization, Section 2.2.5 (Sensitivity of nondegenerate minimal points)
Oliver Stein
Mixed-Integer Optimization I, Section 2.2 (Solvability)
Mixed-Integer Optimization I, Section 2.2 (Solvability)
Oliver Stein
Mixed-Integer Optimization I, Section 2 (Mixed-integer linear optimization), Introduction
Mixed-Integer Optimization I, Section 2 (Mixed-integer linear optimization), Introduction
Oliver Stein
Parametric Optimization, Section 4.2.4 (An equivalent optimization problem), Section 4.2.5 (Regularization of the gap function), Section 4.2.6 (Continuity of the gap fct.), Section 4.2.7 (Differentiability of the gap fct.)
Parametric Optimization, Section 4.2.4 (An equivalent optimization problem), Section 4.2.5 (Regularization of the gap function), Section 4.2.6 (Continuity of the gap fct.), Section 4.2.7 (Differentiability of the gap fct.)
Oliver Stein
Parametric Optimization, Section 4.2.2 (The combined KKT system)
Parametric Optimization, Section 4.2.2 (The combined KKT system)
Oliver Stein
Global Optimization I, Section 2.7.4 (Geometric interpretation of the KKT conditions)
Global Optimization I, Section 2.7.4 (Geometric interpretation of the KKT conditions)
Oliver Stein
Global Optimization I, Section 2.7.3 (Complementarity)
Global Optimization I, Section 2.7.3 (Complementarity)
Oliver Stein
Global Optimization I, Section 2.7 (Optimality conditions for constrained convex problems); Section 2.7.1 (Lagrange- and Wolfe-duality), part 1
Global Optimization I, Section 2.7 (Optimality conditions for constrained convex problems); Section 2.7.1 (Lagrange- and Wolfe-duality), part 1
Oliver Stein
Global Optimization I, Section 2.6 (Monotonicity characterization of convexity)
Global Optimization I, Section 2.6 (Monotonicity characterization of convexity)
Oliver Stein
Global Optimization I, Section 2.5.2 (C2-characterizations)
Global Optimization I, Section 2.5.2 (C2-characterizations)
Oliver Stein
Global Optimization I, Section 2.5.1 (Higher-dimensional second derivatives)
Global Optimization I, Section 2.5.1 (Higher-dimensional second derivatives)
Oliver Stein
Global Optimization I, Section 2.4 (Optimality conditions for unconstrained convex problems)
Global Optimization I, Section 2.4 (Optimality conditions for unconstrained convex problems)
Oliver Stein
Global Optimization I, Section 2.3 (Solvability of convex optimization problems)
Global Optimization I, Section 2.3 (Solvability of convex optimization problems)
Oliver Stein
Global Optimization I, Section 2.2.2 (C1-characterization)
Global Optimization I, Section 2.2.2 (C1-characterization)
Oliver Stein
Global Optimization I, Section 2.1 (Convexity), part 1
Global Optimization I, Section 2.1 (Convexity), part 1
Oliver Stein
Global Optimization I, Section 1.2.5 (Non-closed feasible sets)
Global Optimization I, Section 1.2.5 (Non-closed feasible sets)
Oliver Stein
Global Optimization I, Section 1.2.4 (Unbounded feasible sets), part 1
Global Optimization I, Section 1.2.4 (Unbounded feasible sets), part 1
Oliver Stein
Global Optimization I, Section 1.2.2 (Types of unsolvability)
Global Optimization I, Section 1.2.2 (Types of unsolvability)
Oliver Stein
Global Optimization I, Section 1.2.3 (Weierstrass theorem)
Global Optimization I, Section 1.2.3 (Weierstrass theorem)
Oliver Stein
Global Optimization I, Section 1.1 (Examples and notions), part 3
Global Optimization I, Section 1.1 (Examples and notions), part 3
Oliver Stein
Global Optimization I, Section 1.1 (Examples and notions), part 2
Global Optimization I, Section 1.1 (Examples and notions), part 2
Oliver Stein
Global Optimization I, Section 1.1 (Examples and notions), part 1
Global Optimization I, Section 1.1 (Examples and notions), part 1
Oliver Stein
Parametric Optimization, Introduction
Parametric Optimization, Introduction
Oliver Stein
Convex Analysis, Section 5.6 (A choice of the parameter r)
Convex Analysis, Section 5.6 (A choice of the parameter r)
Oliver Stein
Convex Analysis, Section 5.5 (Monotonicity of the convex subdifferential)
Convex Analysis, Section 5.5 (Monotonicity of the convex subdifferential)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.7 (A dual description of the reduced feasible set)
Mixed-Integer Optimization I, Section 2.6.7 (A dual description of the reduced feasible set)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.8 (The Benders reformulation of MILP)
Mixed-Integer Optimization I, Section 2.6.8 (The Benders reformulation of MILP)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.6 (A dual description of the reduced objective function)
Mixed-Integer Optimization I, Section 2.6.6 (A dual description of the reduced objective function)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.5 (A purely discrete problem, equivalent to MILP)
Mixed-Integer Optimization I, Section 2.6.5 (A purely discrete problem, equivalent to MILP)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.4 (Unsolvability and connections between the inner problems)
Mixed-Integer Optimization I, Section 2.6.4 (Unsolvability and connections between the inner problems)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.3 (A functional description of the reduced feasible set)
Mixed-Integer Optimization I, Section 2.6.3 (A functional description of the reduced feasible set)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.2 (The reduced objective function of MILP)
Mixed-Integer Optimization I, Section 2.6.2 (The reduced objective function of MILP)
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.1 (Benders decomposition / general decomposition)
Mixed-Integer Optimization I, Section 2.6.1 (Benders decomposition / general decomposition)
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.6 (Gomory's split cut), part 2
Mixed-Integer Optimization I, Section 2.5.6 (Gomory's split cut), part 2
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.5 (Split inequalities)
Mixed-Integer Optimization I, Section 2.5.5 (Split inequalities)
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.4 (The mixed-integer case)
Mixed-Integer Optimization I, Section 2.5.4 (The mixed-integer case)
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.2 (The purely integer case), part 2
Mixed-Integer Optimization I, Section 2.5.2 (The purely integer case), part 2
Oliver Stein
Mixed-Integer Optimization I, Section 2.5.1 (General cuts)
Mixed-Integer Optimization I, Section 2.5.1 (General cuts)
Oliver Stein
Mixed-Integer Optimization I, Section 2.5 (Gomory Cuts - Introduction)
Mixed-Integer Optimization I, Section 2.5 (Gomory Cuts - Introduction)
Oliver Stein
Mixed-Integer Optimization I, Section 2.4.4 (Iterative Branching), Section 2.4.5 (Construction of the subdivision), Section 2.4.6 (Initialization), Section 2.4.7 (Termination), Section 2.4.8 (Tuning), Section 2.4.9 (Unboundedness)
Mixed-Integer Optimization I, Section 2.4.4 (Iterative Branching), Section 2.4.5 (Construction of the subdivision), Section 2.4.6 (Initialization), Section 2.4.7 (Termination), Section 2.4.8 (Tuning), Section 2.4.9 (Unboundedness)
Oliver Stein
Mixed-Integer Optimization I, Section 2.3.5 (Measuring infeasibility by geometrical distance)
Mixed-Integer Optimization I, Section 2.3.5 (Measuring infeasibility by geometrical distance)
Oliver Stein
Mixed-Integer Optimization I, Section 2.3.3 (Error bounds via inner parallel sets), part 3
Mixed-Integer Optimization I, Section 2.3.3 (Error bounds via inner parallel sets), part 3
Oliver Stein
Mixed-Integer Optimization I, Section 2.6.10 (Iterative solution by a cutting plane method), part 2
Mixed-Integer Optimization I, Section 2.6.10 (Iterative solution by a cutting plane method), part 2
Oliver Stein
Mixed-Integer Optimization I, Section 2.3.3 (Error bounds via inner parallel sets), part 2
Mixed-Integer Optimization I, Section 2.3.3 (Error bounds via inner parallel sets), part 2
Oliver Stein
Mixed-Integer Optimization I, Section 2.3.2 (Rounding), part 2
Mixed-Integer Optimization I, Section 2.3.2 (Rounding), part 2
Oliver Stein
Mixed-Integer Optimization I, Section 2.3.2 (Rounding), part 1
Mixed-Integer Optimization I, Section 2.3.2 (Rounding), part 1
Oliver Stein
Mixed-Integer Optimization I, Section 1.1 (Examples and terminology), part 3
Mixed-Integer Optimization I, Section 1.1 (Examples and terminology), part 3
Oliver Stein
Convex Analysis, Section 5.2 (A mean value theorem for convex functions), Section 5.3 (Existence of global Lipschitz constants)
Convex Analysis, Section 5.2 (A mean value theorem for convex functions), Section 5.3 (Existence of global Lipschitz constants)
Oliver Stein
Convex Analysis, Section 5.1 (Safety distance in the set approximation example)
Convex Analysis, Section 5.1 (Safety distance in the set approximation example)
Oliver Stein
Convex Analysis, Section 4.1 (Convex subdifferential), part 7 (Computation of one-sided directional derivatives, rules of computation)
Convex Analysis, Section 4.1 (Convex subdifferential), part 7 (Computation of one-sided directional derivatives, rules of computation)
Oliver Stein
Convex Analysis, Section 4.1 (Convex subdifferential), part 5 (Constraint Qualifications, continued)
Convex Analysis, Section 4.1 (Convex subdifferential), part 5 (Constraint Qualifications, continued)
Oliver Stein
Convex Analysis, Section 4.1 (Convex subdifferential), part 4 (Constraint Qualifications)
Convex Analysis, Section 4.1 (Convex subdifferential), part 4 (Constraint Qualifications)
Oliver Stein
Convex Analysis, Section 4.1 (Convex subdifferential), part 2 (Critical points)
Convex Analysis, Section 4.1 (Convex subdifferential), part 2 (Critical points)
Oliver Stein