相关论文: Revisiting the Hahn-Banach Theorem and Nonlinear I…
We use an extension to the infinite dimension of the rank theorem of the differential calculus to establish a Karush-Huhn-Tucker theorem for optimization problems in Banach spaces. We provide an application to variational problems on…
Computational properties of the Hahn-Banach theorem have been studied in computable, constructive and reverse mathematics and in all these approaches the theorem is equivalent to weak K\H{o}nig's lemma. Gherardi and Marcone proved that this…
We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming problems. We pay special attention in the case that the functional constraint belongs to a…
The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
We propose an input convex neural network (ICNN)-based self-supervised learning framework to solve continuous constrained optimization problems. By integrating the augmented Lagrangian method (ALM) with the constraint correction mechanism,…
A linear functional of an object from a convex symmetric set can be optimally estimated, in a worst-case sense, by a linear functional of observations made on the object. This well-known fact is extended here to a nonlinear setting: other…
A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…
This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution…
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…
We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…
The concept of b-linear functional and its different types of continuity in linear n-normed space are presented and some of their properties are being established. We derive the Uniform Boundedness Principle and Hahn-Banach extension…
In this paper, we obtain a minimax theorem by means of which, in turn, we prove the following result: Let $E$ be an infinite-dimensional reflexive real Banach space, $T:E\to E$ a non-zero compact linear operator, $\varphi:E\to {\bf R}$ a…
We provide new results of first-order necessary conditions of optimality problem in the form of John's theorem and in the form of Karush-Kuhn-Tucker's theorem. We establish our result in a topological vector space for problems with…
In this paper, we prove the strong convergence theorems for nearly nonexpansive mappings, using the modified Picard-Mann hybrid iteration process in the context of uniformly convex Banach space.
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
A number of landmark existence theorems of nonlinear functional analysis follow in a simple and direct way from the basic separation of convex closed sets in finite dimension via elementary versions of the Knaster-Kuratowski-Mazurkiewicz…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
Chapter 1 deals with the problem of the existence of an upper/lower envelope from a convex cone or, more generally, a convex set for functions on the projective limit of vector lattices with values in the completion of the Kantorovich space…