2,142 research outputs found

    Optimality conditions for scalar and vector optimization problems with quasiconvex inequality constraints

    Get PDF
    Let X be a real linear space, X0 X a convex set, Y and Z topological real linear spaces. The constrained optimization problem minCf(x), g(x) 2 -K is considered, where f : X0 ! Y and g : X0 ! Z are given (nonsmooth) functions, and C Y and K Z are closed convex cones. The weakly efficient solutions (w-minimizers) of this problem are investigated. When g obeys quasiconvex properties, first-order necessary and first-order sufficient optimality conditions in terms of Dini directional derivatives are obtained. In the special case of problems with pseudoconvex data it is shown that these conditions characterize the global w-minimizers and generalize known results from convex vector programming. The obtained results are applied to the special case of problems with finite dimensional image spaces and ordering cones the positive orthants, in particular to scalar problems with quasiconvex constraints. It is shown, that the quasiconvexity of the constraints allows to formulate the optimality conditions using the more simple single valued Dini derivatives instead of the set valued ones. Key words: Vector optimization, nonsmooth optimization, quasiconvex vector functions, pseudoconvex vector functions, Dini derivatives, quasiconvex programming, Kuhn-Tucker conditions..

    Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving

    Full text link
    We derive efficient algorithms for coarse approximation of algebraic hypersurfaces, useful for estimating the distance between an input polynomial zero set and a given query point. Our methods work best on sparse polynomials of high degree (in any number of variables) but are nevertheless completely general. The underlying ideas, which we take the time to describe in an elementary way, come from tropical geometry. We thus reduce a hard algebraic problem to high-precision linear optimization, proving new upper and lower complexity estimates along the way.Comment: 15 pages, 9 figures. Submitted to a conference proceeding
    • …
    corecore