Iterative algorithms with seminorm-induced oblique projections.
Iterative approximation to convex feasibility problems in Banach space.
Kuhn-Tucker-Theorie für Funktionen mit Richtungsableitungen
L'affectation exponentielle et le problème du plus court chemin dans un graphe
Legendre functions and the method of random Bregman projections.
Limit behaviour of trajectories involving subgradients of convex functions
Line Search by Curve Fitting in Minimization Algorithms.
Linear fractional program under interval and ellipsoidal uncertainty
In this paper, the robust counterpart of the linear fractional programming problem under linear inequality constraints with the interval and ellipsoidal uncertainty sets is studied. It is shown that the robust counterpart under interval uncertainty is equivalent to a larger linear fractional program, however under ellipsoidal uncertainty it is equivalent to a linear fractional program with both linear and second order cone constraints. In addition, for each case we have studied the dual problems...
Lineare Optimierung in halbgeordneten Vektorräumen.
Lipschitz modulus in convex semi-infinite optimization via d.c. functions
We are concerned with the Lipschitz modulus of the optimal set mapping associated with canonically perturbed convex semi-infinite optimization problems. Specifically, the paper provides a lower and an upper bound for this modulus, both of them given exclusively in terms of the problem’s data. Moreover, the upper bound is shown to be the exact modulus when the number of constraints is finite. In the particular case of linear problems the upper bound (or exact modulus) adopts a notably simplified...
Lipschitz modulus in convex semi-infinite optimization via d.c. functions
We are concerned with the Lipschitz modulus of the optimal set mapping associated with canonically perturbed convex semi-infinite optimization problems. Specifically, the paper provides a lower and an upper bound for this modulus, both of them given exclusively in terms of the problem's data. Moreover, the upper bound is shown to be the exact modulus when the number of constraints is finite. In the particular case of linear problems the upper bound (or exact modulus) adopts a notably simplified...
Lokale Berührungskegel einer Menge im Euklidischen Raum
Mathematical programming problems involving continuum of inequality constraints
Maximal monotone relations and the second derivatives of nonsmooth functions
Method for solving a convex integer programming problem.
Méthodes du second ordre dans les problèmes d'optimisation avec contraintes
Metric subregularity for nonclosed convex multifunctions in normed spaces
In terms of the normal cone and the coderivative, we provide some necessary and/or sufficient conditions of metric subregularity for (not necessarily closed) convex multifunctions in normed spaces. As applications, we present some error bound results for (not necessarily lower semicontinuous) convex functions on normed spaces. These results improve and extend some existing error bound results.
Minimal-Energy Clusters of Hard Spheres.
Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
Minimization of nonsmooth convex functionals in Banach spaces.