convex program
Смотреть что такое "convex program" в других словарях:
Convex Computer — Corporation was a company that developed, manufactured and marketed vector minisupercomputers and supercomputers for small to medium sized businesses. Their later Exemplar series of parallel computing machines were based on the Hewlett Packard… … Wikipedia
Quadratically constrained quadratic program — In mathematics, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form: egin{align} ext{minimize} frac12 x^ op P 0 x + q… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Cutting-plane method — In mathematical optimization, the cutting plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are popularly used to… … Wikipedia
Невыпуклое программирование — [non convex programming] раздел математического программирования, изучающий методы решения таких экстремальных задач, целевая функция которых является невыпуклой (см. Выпуклость, вогнутость). Задачи Н.п. обладают той особенностью, что в них не… … Экономико-математический словарь
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Conic optimization — is a subfield of convex optimization that studies a class of structured convex optimization problems called conic optimization problems. A conic optimization problem consists of minimizing a convex function over the intersection of an affine… … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Mathematical economics — Economics … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia
Polyomino — The 18 one sided pentominoes, including 6 mirrored pairs … Wikipedia
