Search

This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We introduce, study, and utilize a novel notion of quasi-near convexity of sets that is an infinite-dimensional extension of the widely acknowledged notion of near convexity. Quasi-near convexity is associated with the quasi-relative interior of sets, which is investigated in the paper together with other generalized relative interior notions for sets, not necessarily convex. In this way, we obtain new results on generalized relative interiors for graphs of set-valued mappings in convexity and generalized convexity settings. [ABSTRACT FROM AUTHOR]

In this paper we study the concept of algebraic core for convex sets in general vector spaces without any topological structure and then present its applications to problems of convex analysis and optimization. Deriving the equivalence between the Hahn-Banach theorem and and a simple version of the separation theorem of convex sets in vector spaces allows us to develop a geometric approach to generalized differential calculus for convex sets, set-valued mappings, and extended-real-valued functions with qualification conditions formulated in terms of algebraic cores for such objects. We also obtain a precise formula for computing the subdifferential of optimal value functions associated with convex problems of parametric optimization in vector spaces. Functions of this type play a crucial role in many aspects of convex optimization and its applications. [ABSTRACT FROM AUTHOR]

The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsic discrete, nonconvex, and nondifferentiable nature. We provide a reformulation of these problems as those of continuous optimization and then develop a new DC type algorithm for their solutions involving Nesterov's smoothing. The proposed algorithm is computationally implemented via MATLAB numerical tests on both artificial and real data sets. [ABSTRACT FROM AUTHOR]

The paper is devoted to the study and applications of criticality of Lagrange multipliers in variational systems, which are associated with the class of problems in composite optimization known as extended nonlinear programming (ENLP). The importance of both ENLP and the concept of multiplier criticality in variational systems has been recognized in theoretical and numerical aspects of optimization and variational analysis, while the criticality notion has never been investigated in the ENLP framework. We present here a systematic study of critical and noncritical multipliers in a general variational setting that covers, in particular, KKT systems in ENLP with establishing their verifiable characterizations as well as relationships between noncriticality and other stability notions in variational analysis. Our approach is mainly based on advanced tools of second-order variational analysis and generalized differentiation. [ABSTRACT FROM AUTHOR]

This paper pursues a twofold goal. Firstly, we aim at deriving novel second-order characterizations of important robust stability properties of perturbed Karush–Kuhn–Tucker systems for a broad class of constrained optimization problems generated by parabolically regular sets. Secondly, the obtained characterizations are applied to establish well-posedness and superlinear convergence of the basic sequential quadratic programming method to solve parabolically regular constrained optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic results of convex subdifferential calculus in full generality and also derive new results of convex analysis concerning optimal value/marginal functions, normals to inverse images of sets under set-valued mappings, calculus rules for coderivatives of single-valued and set-valued mappings, and calculating coderivatives of solution maps to parameterized generalized equations governed by set-valued mappings with convex graphs. [ABSTRACT FROM AUTHOR]

This paper proposes and justifies two globally convergent Newton-type methods to solve unconstrained and constrained problems of nonsmooth optimization by using tools of variational analysis and generalized differentiation. Both methods are coderivative-based and employ generalized Hessians (coderivatives of subgradient mappings) associated with objective functions, which are either of class C1,1\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${{\mathcal {C}}}^{1,1}$$\end{document}, or are represented in the form of convex composite optimization, where one of the terms may be extended-real-valued. The proposed globally convergent algorithms are of two types. The first one extends the damped Newton method and requires positive-definiteness of the generalized Hessians for its well-posedness and efficient performance, while the other algorithm is of the regularized Newton-type being well-defined when the generalized Hessians are merely positive-semidefinite. The obtained convergence rates for both methods are at least linear, but become superlinear under the semismooth∗\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$^*$$\end{document} property of subgradient mappings. Problems of convex composite optimization are investigated with and without the strong convexity assumption on smooth parts of objective functions by implementing the machinery of forward–backward envelopes. Numerical experiments are conducted for Lasso problems and for box constrained quadratic programs with providing performance comparisons of the new algorithms and some other first-order and second-order methods that are highly recognized in nonsmooth optimization. [ABSTRACT FROM AUTHOR]

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to optimization and stability. This class consists of lower semicontinuous functions with possibly infinite values on finite-dimensional spaces, which are labeled as “piecewise linear” ones and can be equivalently described via the convexity of their epigraphs. In this paper we calculate the second-order subdifferentials (generalized Hessians) of arbitrary convex piecewise linear functions, together with the corresponding geometric objects, entirely in terms of their initial data. The obtained formulas allow us, in particular, to justify a new exact (equality-type) second-order sum rule for such functions in the general nonsmooth setting. [ABSTRACT FROM AUTHOR]