Related papers: Exact formulas for the proximal/regular/limiting n…
In this paper, we accomplish a unified convergence analysis of a second-order method of multipliers (i.e., a second-order augmented Lagrangian method) for solving the conventional nonlinear conic optimization problems.Specifically, the…
Low-complexity non-smooth convex regularizers are routinely used to impose some structure (such as sparsity or low-rank) on the coefficients for linear predictors in supervised learning. Model consistency consists then in selecting the…
The subject of this paper is regularity-preserving aggregation of regular norms on finite-dimensional linear spaces. Regular norms were introduced in [5] and are closely related to ``type 2'' spaces [9, Chapter 9] playing important role in…
This paper investigates the behavior of sets and functions at infinity by introducing new concepts, namely directional normal cones at infinity for unbounded sets, along with limiting and singular subdifferentials at infinity in the…
We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. We also consider two fragments of second-order HyperLTL that…
Approximating solutions of ordinary and partial differential equations constitutes a significant challenge. Based on functional expressions that inherently depend on neural networks, neural forms are specifically designed to precisely…
We study a class of second-order boundary-degenerate elliptic equations in two dimensions with minimal regularity assumptions. We prove a maximum principle and a Harnack inequality at the degenerate boundary, and assuming local boundedness,…
The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
In this note, we present an elementary proof for a well-known second-order sufficient optimality condition in nonlinear semidefinite optimization which does not rely on the enhanced theory of second-order tangents. Our approach builds on an…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Although the Karush-Kuhn-Tucker conditions suggest a connection between a conic optimization problem and a complementarity problem, it is difficult to find an accessible explicit form of this relationship in the literature. This note will…
We present necessary and sufficient optimality conditions for finite time optimal control problems for a class of hybrid systems described by linear complementarity models. Although these optimal control problems are difficult in general…
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions.…
For a second-order elliptic equation in divergence form we investigate conditions on the coefficients which imply that all solutions are Lipschitz continuous or differentiable at a given point. We assume the coefficients have modulus of…
A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.
A new problem is studied, the concept of exactness of a second order nonlinear ordinary differential equations is established. A method is constructed to reduce this class into a first order equations. If the second order equation is not…
We give an unified framework to solve rough differential equations. Based on flows, our approach unifies the former ones developed by Davie, Friz-Victoir and Bailleul. The main idea is to build a flow from the iterated product of an almost…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
We discuss the cone and contraction theorem in a suitable complex analytic setting. More precisely, we establish the cone and contraction theorem of normal pairs for projective morphisms between complex analytic spaces. This result is a…