Related papers: Conic cancellation laws and some applications
We are interested in existence results for second order differential inclusions, involving finite number of unilateral constraints in an abstract framework. These constraints are described by a set-valued operator, more precisely a proximal…
By studying modular invariance properties of some characteristic forms, we obtain twisted anomaly cancellation formulas. We apply these twisted cancellation formulas to study divisibilities on spin manifolds and congruences on spin$^c$…
Motivated by simulations of carbon nanocones (see Jordan and Crespi, Phys. Rev. Lett., 2004), we consider a variational plate model for an elastic cone under compression in the direction of the cone symmetry axis. Assuming radial symmetry,…
Conservation laws are of great theoretical and practical interest. We describe a novel approach to machine learning conservation laws of finite-dimensional dynamical systems using trajectory data. It is the first such approach based on…
We investigate constrained optimal control problems for linear stochastic dynamical systems evolving in discrete time. We consider minimization of an expected value cost over a finite horizon. Hard constraints are introduced first, and then…
The aim of this paper is to introduce the notion of cornets, which form a particular subclass of ordered semigroups also equipped with a multiplication by natural numbers. The most important standard examples for cornets are the families of…
A parametric constrained convex optimal control problem, where the initial state is perturbed and the linear state equation contains a noise, is considered in this paper. Formulas for computing the subdifferential and the singular…
This paper aims at investigating the contractibility of the solution sets for set optimization problems by utilizing strictly quasi cone-convexlikeness, which is an assumption weaker than strictly cone-convexity, strictly…
By studying modular invariance properties of some characteristic forms, we get some new anomaly cancellation formulas on $(4r-1)$ dimensional manifolds. As an application, we derive some results on divisibilities of the index of Toeplitz…
We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…
Tangent and normal cones play an important role in constrained optimization to describe admissible search directions and, in particular, to formulate optimality conditions. They notably appear in various recent algorithms for both smooth…
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the…
Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…
The order relations of continuous cancellative t-subnorms are discussed. First, we present some necessary and sufficient conditions along with several interesting sufficient criteria for the comparability of continuous cancellative…
Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
We present a methodology that extends invariant manifold theory to a class of autonomous piecewise linear systems with nonsmoothness at the equilibrium, providing a framework for model order reduction in mechanical structures with compliant…
In this paper we consider a mass optimization problem in the case of scalar state function, where instead of imposing a constraint on the total mass of the competitors, we penalize the classical compliance by a convex functional defined on…
This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…