Kolmogorov–Zurbenko filter

From formulasearchengine
Revision as of 22:37, 8 January 2014 by en>BG19bot (WP:CHECKWIKI error fix for #64. Do general fixes if a problem exists. - using AWB (9838))
Jump to navigation Jump to search

Vector optimization is an optimization problem of simultaneously optimizing multiple objective functions subject to constraints and a given ordering. Any multi-objective optimization problem is a vector optimization problem with the trivial ordering.

Canonical example

In mathematical terms, the vector optimization problem can be written as:

CminxMf(x)

where f:XZ for some vector spaces X,Z, MX, CZ is an ordering cone in Z, and Cmin denotes minimizing with respect to the ordering cone.

The solution to this minimization problem is the smallest set S such that for every sS there exists a xM where f(x)=s and S+C{f(x):xM}.

Solution types

Every p-minimizer is an e-minimizer. And every e-minimizer is a w-minimizer.[1]

Solution methods

Relation to multi-objective optimization

Any multi-objective optimization problem can be written as

+dminxMf(x)

where f:Xd and +d is the positive orthant of d. Thus the solution set of this vector optimization problem is given by the Pareto efficient points.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. Template:Cite doi
  2. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534