English
Related papers

Related papers: Optimality conditions for an exhausterable functio…

200 papers

Exhausters are families of compact, convex sets which provide minmax or maxmin representations of positively homogeneous functions and they are efficient tools for the study of nonsmooth function. Upper and lower exhausters of positively…

Optimization and Control · Mathematics 2020-09-08 Didem Tozkan

Exhausters and coexhausters are notions of constructive nonsmooth analysis which are used to study extremal properties of functions. An upper exhauster (coexhauster) is used to get an approximation of a considered function in the…

Optimization and Control · Mathematics 2025-11-18 Majid E. Abbasov

The notions of upper and lower exhausters are effective tools for the study of non smooth functions. There are many studies presenting optimality conditions for unconstrained and constrained cases. One can observe that optimality conditions…

Optimization and Control · Mathematics 2021-01-28 Mustafa Soyertem , İlknur Atasever Güvenç , Didem Tozkan

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughly) that Slater's condition holds, the functions involved are…

Optimization and Control · Mathematics 2019-11-13 Shane Barratt

The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with finitely many convex objective functions and infinitely…

Optimization and Control · Mathematics 2016-08-11 Miguel A. Goberna , Nader Kanzi

In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…

Machine Learning · Computer Science 2015-05-08 Bharath Sankaran , Marjan Ghazvininejad , Xinran He , David Kale , Liron Cohen

In this paper we maximize a class of functionals under certain constraints. We find sufficient and necessary conditions for these maximizers to exist and be unique. Moreover, we characterize them and discuss the optimality of our results by…

Functional Analysis · Mathematics 2010-03-17 Cristina Draghici , Hichem Hajaiej

Codifferentials and coexhausters are used to describe nonhomogeneous approximations of a nonsmooth function. Despite the fact that coexhausters are modern generalizations of codifferentials, the theories of these two concepts continue to…

Optimization and Control · Mathematics 2021-11-29 Majid E. Abbasov

In the present work we study a problem of finding a global minimum of a piecewise affine function. We employ optimality conditions for the problem in terms of coexhausters and use them to state and prove necessary and sufficient conditions…

Optimization and Control · Mathematics 2020-12-21 Majid E. Abbasov

A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented.…

Computational Complexity · Computer Science 2007-05-23 Victor Korotkikh , Galina Korotkikh , Darryl Bond

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Classical Analysis and ODEs · Mathematics 2014-08-19 Heinz H. Bauschke , Yves Lucet , Hung M. Phan

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

Optimization and Control · Mathematics 2025-08-22 Thabo Samakhoana , Benjamin Grimmer

We outline necessary and sufficient condition to the existence of extrmas of a function on a self-similar set, and we describe discrete gradient algorithm to find the extrema.

Metric Geometry · Mathematics 2018-12-10 Nizar Riane , Claire David

A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…

Optimization and Control · Mathematics 2012-07-24 Andreas H. Hamel , Carola Schrage

In this paper, we obtain optimality conditions for the problem with inequality, equality and closed set constraints in terms of the lower Hadamard derivative. The results are obtained applying exact penalty functions.

Optimization and Control · Mathematics 2026-02-23 Vsevolod Ivanov Ivanov

In mathematical economics, the used functions are, in general, considered to be quasiconcave. Moreover, they are, in many cases, separable of nature. It is known that a local maximum of a quasiconcave function is not, in general, a global…

Optimization and Control · Mathematics 2021-01-14 Mohammed Berdi , Mohammed Amine Abouchouar , Abdelhak Hassouni

In this paper, we introduce a new second-order directional derivative and a second-order subdifferential of Hadamard type for an arbitrary nondifferentiable function. We derive several second-order optimality conditions for a local and a…

Optimization and Control · Mathematics 2018-05-24 Vsevolod I. Ivanov

Let $\mathfrak{n}$ be a nonempty, proper, convex subset of $\mathbb{C}$. The $\mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $\mathfrak{n}$ and are maximal with this property. Typical examples of…

Functional Analysis · Mathematics 2023-10-31 Rosario Corso

In this article we consider a convex feasible set described by inequality constraints that are continuous and not necessarily Lipschitz or convex. We show that if the Slater constraint qualification and a non-degeneracy condition are…

Optimization and Control · Mathematics 2019-02-11 S R Pattanaik
‹ Prev 1 2 3 10 Next ›