English
Related papers

Related papers: Real Noncommutative Convexity II: Extremality and …

200 papers

Lossless Convexification (LCvx) is a modeling approach that transforms a class of nonconvex optimal control problems, where nonconvexity primarily arises from control constraints, into convex problems through convex relaxations. These…

Optimization and Control · Mathematics 2025-04-01 Dayou Luo , Kazuya Echigo , Behçet Açıkmeşe

A fundamental open question asking whether all real-valued strongly quasiconvex functions defined on $\mathbb R^n$ are necessarily continuous, akin to their convex counterparts, is answered in detail in this paper. Among other things, we…

Optimization and Control · Mathematics 2025-12-04 Nguyen Thi Van Hang , Felipe Lara , Nguyen Dong Yen

The paper proposes another extension of the extremal principle. A new extremality model involving collections of arbitrary families of sets is studied. It generalizes the conventional model based on linear translations of given sets as well…

Optimization and Control · Mathematics 2024-09-04 Nguyen Duy Cuong , Alexander Y. Kruger , Nguyen Hieu Thao

Motivated by the novel applications of the mathematical formalism of quantum theory and its generalizations in cognitive science, psychology, social and political sciences, and economics, we extend the notion of the tensor product and…

General Physics · Physics 2015-06-04 Andrei Khrennikov , Elemer E. Rosinger

In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…

Information Theory · Computer Science 2015-03-20 Tomasz Sobieszek

Two classical results characterizing regularity of a convergence space in terms of continuous extensions of maps on one hand, and in terms of continuity of limits for the continuous convergence on the other, are extended to…

General Topology · Mathematics 2014-10-31 Eva Colebunders , Frédéric Mynard , Will Trott

Three-dimensional N-extended superconformal symmetry is studied within the superspace formalism. A superconformal Killing equation is derived and its solutions are classified in terms of supertranslations, dilations, Lorentz…

High Energy Physics - Theory · Physics 2016-09-06 Jeong-Hyuck Park

Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…

General Topology · Mathematics 2015-11-25 Raúl Fierro

The main focus of the present work is to study the Feynman's proof of the Maxwell equations using the NC geometry framework. To accomplish this task, we consider two kinds of noncommutativity formulations going along the same lines as…

High Energy Physics - Theory · Physics 2009-11-10 A. Boulahoual , M. B. Sedra

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

Optimization and Control · Mathematics 2020-01-30 Coralia Cartis , Nick Gould , Philippe L. Toint

We discuss the problem of the existence of envelopes of holomorphy of the A-crosses, which leads us to the far-reaching generalizations of the famous Hartogs theorem. We also take under consideration the issue of the existence of "nice"…

Complex Variables · Mathematics 2013-04-24 Arkadiusz Lewandowski

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of…

Logic · Mathematics 2023-09-13 Tom de Jong

We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…

Optimization and Control · Mathematics 2021-05-04 Vincent Guigues

The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…

Optimization and Control · Mathematics 2022-07-19 Francesco Bullo , Pedro Cisneros-Velarde , Alexander Davydov , Saber Jafarpour

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

Relative smoothness and strong convexity have recently gained considerable attention in optimization. These notions are generalizations of the classical Euclidean notions of smoothness and strong convexity that are known to be dual to each…

Optimization and Control · Mathematics 2024-04-17 Emanuel Laude , Andreas Themelis , Panagiotis Patrinos

We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…

General Mathematics · Mathematics 2010-10-19 J. Kiukas , J. -P. Pellonpää

Pseudo-holomorphic curves on almost complex manifolds have been much more intensely studied than their "dual" objects, the plurisubharmonic functions. These functions are defined classically by requiring that the restriction to each…

Complex Variables · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson

A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…

Mathematical Physics · Physics 2015-05-08 Enrico Massa , Danilo Bruno , Gianvittorio Luria , Enrico Pagani

A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…

Functional Analysis · Mathematics 2016-08-30 Fredrik Andersson , Marcus Carlsson , Carl Olsson