Bounded diagonally stationary sequences in convex optimization.
Bounded linear regularity, strong CHIP, and CHIP are distinct properties.
Bounds of the affine breadth eccentricity of convex bodies via semi-infinite optimization.
Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces.
Brève communication. Décomposition en programmation convexe
Brève communication. Minimisation d'une fonctionnelle dans un espace produit par une méthode de relaxation
Brève communication. Une méthode de résolution des problèmes de col
Bundle-based decomposition : conditions for convergence
Characterizations of convex vector functions and optimization.
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...
Characterizations of ɛ-duality gap statements for constrained optimization problems
In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.
Closedness type regularity conditions for surjectivity results involving the sum of two maximal monotone operators
In this note we provide regularity conditions of closedness type which guarantee some surjectivity results concerning the sum of two maximal monotone operators by using representative functions. The first regularity condition we give guarantees the surjectivity of the monotone operator S(· + p) + T(·), where p ɛ X and S and T are maximal monotone operators on the reflexive Banach space X. Then, this is used to obtain sufficient conditions for the surjectivity of S + T and for the situation when...
Computing minimum norm solution of a specific constrained convex nonlinear problem
The characterization of the solution set of a convex constrained problem is a well-known attempt. In this paper, we focus on the minimum norm solution of a specific constrained convex nonlinear problem and reformulate this problem as an unconstrained minimization problem by using the alternative theorem.The objective function of this problem is piecewise quadratic, convex, and once differentiable. To minimize this function, we will provide a new Newton-type method with global convergence properties....
Convergence d'un schéma de minimisation alternée
Convergence of convex-concave saddle functions : applications to convex programming and mechanics
Convergence Results for an Accelerated Nonlinear Cimmino Algorithm.
Convex functionals with good asymptotic behavior on a subset.
Convex inequalities and the Hahn-Banach Theorem [Book]
Convex separable minimization problems with a linear constraint and bounded variables.