相关论文: First Order Optimum Calculi

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

This paper contributes to the theory of orders of number fields. This paper defines a notion of "ray class group" associated to an arbitrary order in a number field together with an arbitrary ray class modulus for that order (including…

In this paper, we give sharp bounds of the difference of the moduli of the second and the first logarithmic coefficient for the functions on the class $\mathcal U$, for the $\alpha$-convex functions, and for the class $\mathcal{G}(\alpha)$…

Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…

A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…

The success of deep learning over the past decade mainly relies on gradient-based optimisation and backpropagation. This paper focuses on analysing the performance of first-order gradient-based optimisation algorithms, gradient descent and…

Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…

We present two first-order, sequential optimization algorithms to solve constrained optimization problems. We consider a black-box setting with a priori unknown, non-convex objective and constraint functions that have Lipschitz continuous…

We pose a new algebraic formalism for studying differential calculus in vector bundles. This is achieved by studying various functors of differential calculus over arbitrary graded commutative algebras (DCGCA) and applying this language to…

Algorithms for bilevel optimization often encounter Hessian computations, which are prohibitive in high dimensions. While recent works offer first-order methods for unconstrained bilevel problems, the constrained setting remains relatively…

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…

This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…

The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…

In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…

A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

Given any algorithm for convex optimization that uses exact first-order information (i.e., function values and subgradients), we show how to use such an algorithm to solve the problem with access to inexact first-order information. This is…

In [5], Bede et al. defined the max-product Meyer-K\"{o}nig and Zeller operator. They examined the approximation and shape preserving properties of this operator, and they found the order of approximation to be $\frac{\sqrt{y}\left(…

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

Using an optimization algorithm to solve a machine learning problem is one of mainstreams in the field of science. In this work, we demonstrate a comprehensive comparison of some state-of-the-art first-order optimization algorithms for…