English
Related papers

Related papers: Projectional Coderivatives and Calculus Rules

200 papers

Establishing explicit formulas of coderivatives with respect to a set of the normal cone mapping to a polyhedron, the solution set of a variational inequalities system, is one of the main goals of this paper. By using our coderivative…

Optimization and Control · Mathematics 2023-12-27 Vo Duc Thinh , Xiaolong Qin , Jen-Chih Yao

In this article, we first show that for all compact Riemannian manifolds with non-empty smooth boundary and dimension at least 3, there exists a metric, pointwise conformal to the original metric, with constant scalar curvature in the…

Differential Geometry · Mathematics 2022-08-25 Jie Xu

This paper addresses smooth convexly constrained optimization problems where the Euclidean projection onto the feasible set is computationally tractable. Although momentum techniques like Polyak's heavy-ball are known for accelerating…

Optimization and Control · Mathematics 2026-03-20 Federica Donnini , Pierluigi Mansueto

The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…

Optimization and Control · Mathematics 2024-03-18 T. J. Meijer , T. Holicki , S. J. A. M. van den Eijnden , C. W. Scherer , W. P. M. H. Heemels

A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…

Geometric Topology · Mathematics 2014-05-29 Suhyoung Choi

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

We develop finite element exterior calculus over weakly Lipschitz domains. Specifically, we construct commuting projections from $L^p$ de~Rham complexes over weakly Lipschitz domains onto finite element de~Rham complexes. These projections…

Numerical Analysis · Mathematics 2016-12-09 Martin Werner Licht

In Part 1 of this paper, we have estimated the Fr\'echet coderivative and the Mordukhovich coderivative of the stationary point set map of a smooth parametric optimization problem with one smooth functional constraint under total…

Optimization and Control · Mathematics 2018-11-15 Duong Thi Kim Huyen , Jen-Chih Yao , Nguyen Dong Yen

The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…

Combinatorics · Mathematics 2011-04-07 Volker Kaibel

In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…

Optimization and Control · Mathematics 2019-03-19 Fabiana R. de Oliveira , Orizon P. Ferreira

In this paper, we establish explicit convergence rates for the stochastic smooth approximations of infimal convolutions introduced and developed in \cite{MR4581306,MR4923371}. In particular, we quantify the convergence of the associated…

Optimization and Control · Mathematics 2026-02-23 Diego Morales , Pedro Pérez-Aros , Emilio Vilches

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

Optimization and Control · Mathematics 2017-10-11 Haihao Lu , Robert M. Freund , Yurii Nesterov

This work advances knowledge of the threshold of prox-boundedness of a function; an important concern in the use of proximal point optimization algorithms and in determining the existence of the Moreau envelope of the function. In finite…

Optimization and Control · Mathematics 2019-09-12 Chayne Planiden

This article aims to make explicit the characteristic projection introduced by Panchishkin in "A new method of constructing p-adic L-functions associated with modular forms" (Moscow Mathematical Journal, 2002) and gives various results on…

Number Theory · Mathematics 2012-12-18 Julien Puydt

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…

Optimization and Control · Mathematics 2021-09-22 Ilnura Usmanova , Maryam Kamgarpour , Andreas Krause , Kfir Yehuda Levy

The paper deals with a new sharp criterion ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class includes parameter-dependent variational inequalities with non-polyhedral constraint sets…

Optimization and Control · Mathematics 2017-04-04 Helmut Gfrerer , Jiří V Outrata

The notion of a (metric) modular on an arbitrary set and the corresponding modular space, more general than a metric space, were introduced and studied recently by the author [V. V. Chistyakov, Metric modulars and their application, Dokl.…

Functional Analysis · Mathematics 2013-05-29 Vyacheslav V. Chistyakov

The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…

Functional Analysis · Mathematics 2017-10-11 Harrison Pugh

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

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

Combinatorics · Mathematics 2024-09-25 Volker Kaibel , Kirill Kukharenko