42,170 research outputs found

    Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces.

    Get PDF
    The main object of this paper is to prove that for a linear or convex multiobjective program, a dual program can be obtained which gives the primal sensitivity without any special hypothesis about the way of choosing the optimal solution in the efficient set.

    Ideal points in multiobjective programming

    Get PDF
    The main object of this paper is to give conditions under which a minimal solution to a problem of mathematical programming can be transformed into a minimum solution in the usual sense of the order relations, or in every case, conditions under which that solution is adherent to the set of the points wich verify this last property. The interest of this problem is clear, since many of the usual properties in optimization (like, for instance, the analysis of the sensitivity of the solutions) are studied more easily for minimum solutions than for minimal solutions

    Sensitivity Analysis for Mirror-Stratifiable Convex Functions

    Get PDF
    This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable". These functions are such that there is a bijection between a primal and a dual stratification of the space into partitioning sets, called strata. This pairing is crucial to track the strata that are identifiable by solutions of parametrized optimization problems or by iterates of optimization algorithms. This class of functions encompasses all regularizers routinely used in signal and image processing, machine learning, and statistics. We show that this "mirror-stratifiable" structure enjoys a nice sensitivity theory, allowing us to study stability of solutions of optimization problems to small perturbations, as well as activity identification of first-order proximal splitting-type algorithms. Existing results in the literature typically assume that, under a non-degeneracy condition, the active set associated to a minimizer is stable to small perturbations and is identified in finite time by optimization schemes. In contrast, our results do not require any non-degeneracy assumption: in consequence, the optimal active set is not necessarily stable anymore, but we are able to track precisely the set of identifiable strata.We show that these results have crucial implications when solving challenging ill-posed inverse problems via regularization, a typical scenario where the non-degeneracy condition is not fulfilled. Our theoretical results, illustrated by numerical simulations, allow to characterize the instability behaviour of the regularized solutions, by locating the set of all low-dimensional strata that can be potentially identified by these solutions
    • …
    corecore