In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
In the numerical solution of large-scale eigenvalue problems, Davidson-type methods are an increasingly popular alternative to Krylov eigensolvers. The main motivation is to avoid ...