Related papers: Regularization of an Indefinite Abstract Interpola…

The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which…

In the context of cubic splines, the authors have contributed to a recent paper dealing with the computation of nonlinear derivatives at the interior nodes so that monotonicity is enforced while keeping the order of approximation of the…

We consider control-constrained linear-quadratic optimal control problems on evolving surfaces. In order to formulate well-posed problems, we prove existence and uniqueness of weak solutions for the state equation, in the sense of…

We study here systems of symmetries on $|1|$--graded parabolic geometries. We are interested in smooth systems of symmetries and we discuss non--flat homogeneous $|1|$--graded geometries. We show the existence of an invariant admissible…

We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability…

In this paper, we consider the linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function. We propose an inexact augmented Lagrangian (IAL) framework for…

Variational regularization and the quasisolutions method are justified for unbounded closed, possibly nonlinear, operators. The argument is quite simple and yields general results.

This paper provides a new method to solve analytic interpolation problems with rationality and derivative constraints, occurring in many applications to system and control. It is based on the covariance extension equation previously…

We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for…

In this paper, we consider a nonconvex optimization problem with nonlinear equality constraints. We assume that both, the objective function and the functional constraints are locally smooth. For solving this problem, we propose a…

We provide simple necessary and sufficient conditions under which a path constitutes a solution to an infinite-horizon, continuous-time optimal control problem. We prove transversality conditions under standard assumptions. We also present…

This paper describes applications of extrapolation for the computation of coefficients in an expansion of infrared divergent integrals. An extrapolation procedure is performed with respect to a parameter introduced by dimensional…

Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…

In this article we present a modified S-iteration process that we combine with inertial extrapolation to find a common solution to the split monotone inclusion problem and the fixed point problem in real Hilbert space.Our goal is to…

We define a notion of general uniform interpolant, generalizing the notions of cover and of uniform interpolant and identify situations in which symbol elimination can be used for computing general uniform interpolants. We investigate the…

Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…

We find sufficient conditions for a discrete sequence to be interpolating or sampling for certain generalized Bergman spaces on open Riemann surfaces. As in previous work of Bendtsson, Ortega-Cerda, Seip, Wallsten and others, our conditions…

We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…

Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…

This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…