Searching: "Category:Optimization"

1. Basis pursuit denoising
   [100%]
   (Computing) [Mathematical optimization] Mathematical optimization problem ...
2. Bilevel optimization
   [100%]
   (Computing) [Mathematical optimization] Quadratic fractional programming problem ...
3. Bilinear program
   [100%]
   (Computing) [Mathematical optimization] ...
4. Clarke's generalized Jacobian
   [100%]
   (Computing) [Mathematical optimization] ...
5. Continuous optimization
   [100%]
   (Computing) [Mathematical optimization] Branch of optimization in applied mathematics ...
6. Descent direction
   [100%]
   (Computing) [Mathematical optimization] ...
7. Discrete optimization
   [100%]
   (Computing) [Mathematical optimization] Branch of mathematical optimization ...
8. Fritz John conditions
   [100%]
   (Computing) [Mathematical optimization] ...
9. Highly optimized tolerance
   [100%]
   (Computing) [Mathematical optimization] ...
10. Human performance modeling
    [100%]
    (Computing) [Software optimization] Human performance modeling ( HPM ) is a method of quantifying ...
11. Jeep problem
    [100%]
    (Computing) [Mathematical optimization] Mathematics and car problem ...
12. Local optimum
    [100%]
    (Computing) [Mathematical optimization] This is in contrast to a global optimum, which is the ...
13. Mathematical programming with equilibrium constraints
    [100%]
    (Computing) [Mathematical optimization] ...
14. Mean field annealing
    [100%]
    (Computing) [Mathematical optimization] ...
15. Mixed complementarity problem
    [100%]
    (Computing) [Mathematical optimization] ...
16. Optimal control
    [100%]
    (Computing) [Mathematical optimization] Mathematical way of attaining a desired output from a dynamic system ...
17. Pseudo-Boolean function
    [100%]
    (Computing) [Mathematical optimization] Generalization of binary functions ...
18. Quadratically constrained quadratic program
    [100%]
    (Computing) [Mathematical optimization] To see this, note that the two constraints x 1 ( ...
19. Robust optimization
    [100%]
    (Computing) [Mathematical optimization] Robust optimization is a field of mathematical optimization theory that deals ...
20. Topological derivative
    [100%]
    (Computing) [Mathematical optimization] The topological derivative is, conceptually, a derivative of a shape functional ...
21. Vector optimization
    [100%]
    (Computing) [Mathematical optimization] Vector optimization is a subarea of mathematical optimization where optimization problems ...
22. Wolfe conditions
    [100%]
    (Computing) [Mathematical optimization] ...
23. Assemble-to-order system
    [100%]
    (Computing) [Inventory optimization] ...
24. Inventory analysis
    [100%]
    (Computing) [Inventory optimization] ...
25. Proximal operator
    [100%]
    (Computing) [Mathematical optimization] ...
26. Overhead
    [100%]
    (Computing) [Software optimization] Computing; Excess resources needed to perform a task ...
27. Greedy randomized adaptive search procedure
    [100%]
    (Computing) [Combinatorial optimization] Metaheuristic commonly used for optimization problems ...
28. Bridge and torch problem
    [100%]
    (Computing) [Combinatorial optimization] Logic puzzle ...
29. List of knapsack problems
    [100%]
    (Computing) [Combinatorial optimization] The knapsack problem is one of the most studied problems in ...
30. Integer programming
    [100%]
    (Computing) [Combinatorial optimization] A mathematical optimization problem restricted to integers ...
31. Linear bottleneck assignment problem
    [100%]
    (Computing) [Combinatorial optimization] 172) In plain words the problem is stated as follows::There are ...
32. Quadratic bottleneck assignment problem
    [100%]
    (Computing) [Combinatorial optimization] ...
33. Parametric search
    [100%]
    (Computing) [Combinatorial optimization] Algorithmic optimization method ...
34. 1-center problem
    [100%]
    (Computing) [Combinatorial optimization] Combinatorial optimization problem ...
35. Quadratic assignment problem
    [100%]
    (Computing) [Combinatorial optimization] Combinatorial optimization problem ...
36. Steiner travelling salesman problem
    [100%]
    (Computing) [Combinatorial optimization] The Steiner traveling salesman problem ( Steiner TSP , or STSP ...
37. Continuous knapsack problem
    [100%]
    (Computing) [Combinatorial optimization] ...
38. Application footprint
    [100%]
    (Computing) [Software optimization] In each case, footprint of an application excludes data that it ...
39. Task skipping
    [100%]
    (Computing) [Software optimization] ...
40. Optimum programming
    [100%]
    (Computing) [Software optimization] In the history of computing, optimum programming , or optimum coding ...
41. Disk footprint
    [100%]
    (Computing) [Software optimization] Disk footprint (or storage footprint) of a software application refers to ...
42. Input enhancement
    [100%]
    (Computing) [Software optimization] Computer science; ...
43. Loop perforation
    [100%]
    (Computing) [Software optimization] Loop perforation is an approximate computing technique that allows to regularly ...
44. Performance engineering
    [100%]
    (Computing) [Software optimization] Encompasses the techniques applied during a systems development life cycle ...
45. Memory footprint
    [100%]
    (Computing) [Software optimization] The amount of memory a computer program uses ...
46. Data organization for low power
    [100%]
    (Computing) [Software optimization] Coupled with high operating frequencies, this has led to unacceptable levels ...
47. Input Enhancement
    [100%]
    (Computing) [Software optimization] Computer Science; ...
48. Code bloat
    [100%]
    (Computing) [Software optimization] Production of unnecessarily long, slow or wasteful program code ...
49. Inline function
    [100%]
    (Computing) [Software optimization] Function in the C and C++ programming languages ...
50. Capacity optimization
    [100%]
    (Computing) [Software optimization] Capacity optimization is a general term for technologies used to improve ...
51. Space–time tradeoff
    [100%]
    (Computing) [Software optimization] Indexes improve the speed of lookup operations at the cost of ...
52. Zero-copy
    [100%]
    (Computing) [Software optimization] Performance is enhanced by allowing the CPU to move on to ...
53. Hot spot
    [100%]
    (Computing) [Software optimization] Computer programming; A hot spot in computer science is most usually defined as ...
54. Lightweight software
    [100%]
    (Computing) [Software optimization] ...
55. Performance prediction
    [100%]
    (Computing) [Software optimization] There are many approaches to predict program 's performance on computers ...
56. Precomputation
    [100%]
    (Computing) [Software optimization] Act of performing an initial computation before run time ...
57. Fast path
    [100%]
    (Computing) [Software optimization] Fast path is a term used in computer science to describe ...
58. Ershov Number
    [100%]
    (Computing) [Software optimization] Ershov numbers , named after Andrey Petrovich Yershov, are used in ...
59. Throughput Maximization
    [100%]
    (Simulation Optimization Library) [Stochastic optimization] The problem of Throughput Maximization is a family of iterative stochastic ...
60. Geometric programming
    [100%]
    (Computing) [Convex optimization] A geometric program ( GP ) is an optimization problem of ...
61. Robbins' problem
    [100%]
    (Computing) [Stochastic optimization] In probability theory, Robbins' problem of optimal stopping , named after ...
62. Wolfe duality
    [100%]
    (Computing) [Convex optimization] The problem : is called the Wolfe dual problem. This problem ...
63. BRST algorithm
    [100%]
    (Computing) [Stochastic optimization] Boender-Rinnooy-Stougie-Timmer algorithm (BRST) is an optimization algorithm suitable for finding global ...
64. Optimal computing budget allocation
    [100%]
    (Computing) [Stochastic optimization] 27–38, Miami, FL, December 2008. It was introduced in the mid-1990s ...
65. Slater's condition
    [100%]
    (Computing) [Convex optimization] ...
66. Entropy maximization
    [100%]
    (Computing) [Convex optimization] ...
67. Shape optimization
    [100%]
    (Computing) [Mathematical optimization] Problem of finding the optimal shape under given conditions ...
68. Linear matrix inequality
    [100%]
    (Computing) [Convex optimization] Mathematical convex optimization ...
69. Stochastic tunneling
    [100%]
    (Computing) [Stochastic optimization] If the dynamical process can escape the well around the current ...
70. Conic optimization
    [100%]
    (Computing) [Convex optimization] Subfield of convex optimization ...
71. Lagrangian relaxation
    [100%]
    (Computing) [Convex optimization] A solution to the relaxed problem is an approximate solution to ...
72. Correlation gap
    [100%]
    (Computing) [Stochastic optimization] Ratio in Mathematical Optimization ...
73. Egalitarian item allocation
    [100%]
    (Computing) [Combinatorial optimization] Fair item allocation problem ...
74. Multidimensional assignment problem
    [100%]
    (Computing) [Combinatorial optimization] Generalization of linear assignment problem from two to multiple dimensions ...
75. Snow plow routing problem
    [100%]
    (Computing) [Combinatorial optimization] The snow plow routing problem is an application of the structure ...
76. Deterministic global optimization
    [100%]
    (Category) [Mathematical optimization] ...
77. Profilers
    [100%]
    (Category) [Software optimization] ...
78. MILEPOST GCC
    [100%]
    (Software) [Software optimization] Self-tuning compiler ...
79. International Society for Structural and Multidisciplinary Optimization
    [100%]
    (Organization) [Mathematical optimization] ...
80. Mathematical Optimization Society
    [100%]
    (Organization) [Mathematical optimization] ...
81. Economic production quantity
    [100%]
    (Finance) [Inventory optimization] Model in inventory management ...
82. Inventory optimization
    [100%]
    (Finance) [Inventory optimization] Business practice for improving location and size of inventory storage ...
83. Newsvendor model
    [100%]
    (Finance) [Inventory optimization] Mathematical model to assist inventory levels ...
84. (Q,r) model
    [100%]
    (Finance) [Inventory optimization] ...
85. Dynamic lot-size model
    [100%]
    (Finance) [Inventory optimization] Mathematical model in economics ...
86. Opaque travel inventory
    [100%]
    (Finance) [Inventory optimization] An opaque inventory is the market of selling unsold travel inventory ...
87. Economic batch quantity
    [100%]
    (Finance) [Inventory optimization] In inventory management, Economic Batch Quantity (EBQ) , also known as ...
88. Economic order quantity
    [100%]
    (Finance) [Inventory optimization] Production scheduling model ...
89. Inventory theory
    [100%]
    (Finance) [Inventory optimization] Material theory (or more formally the mathematical theory of inventory and ...
90. Base stock model
    [100%]
    (Finance) [Inventory optimization] The base stock model is a statistical model in inventory theory. ...
91. Fixed time period model
    [100%]
    (Finance) [Inventory optimization] ...
92. Economic lot scheduling problem
    [100%]
    (Finance) [Inventory optimization] Problem in operations management and inventory theory ...
93. Moreau envelope
    [100%]
    (Computing) [Mathematical optimization] The Moreau envelope (or the Moreau-Yosida regularization) of a proper lower ...
94. Submodular flow
    [100%]
    (Computing) [Combinatorial optimization] Problem in combinatorial optimization ...
95. Power cone
    [100%]
    (Computing) [Convex optimization] ...
96. Center-of-gravity method
    [100%]
    (Computing) [Convex optimization] The center-of-gravity method is a theoretic algorithm for convex optimization. It ...
97. Backtracking line search
    [98%]
    (Computing) [Optimization algorithms and methods] [Mathematical optimization] Mathematical optimization method ...
98. Deterministic global optimization
    [98%]
    (Computing) [Mathematical optimization] [Deterministic global optimization] Deterministic global optimization is a branch of numerical optimization which focuses ...
99. Branch and cut
    [98%]
    (Computing) [Optimization algorithms and methods] [Combinatorial optimization] Branch and cut is a method of combinatorial optimization for solving ...

Too many hits. No search in content will be processed.

More results