English
Related papers

Related papers: A constructive approach to strengthen algebraic de…

200 papers

We present a systematic introduction to first-order optimality conditions for mathematical programs with equilibrium constraints (MPECs), emphasizing the limitations of classical nonlinear programming techniques. The goal is twofold. First,…

Optimization and Control · Mathematics 2026-05-04 Louis Shuo Wang

Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…

Numerical Analysis · Mathematics 2025-04-09 Xiangmin Jiao , Hongji Gao

By extending the classical quantitative approximation results for positive and linear operators in $L^{p}([0, 1]), 1\le p \le +\infty$ of Berens and DeVore in 1978 and of Swetits and Wood in 1983 to the more general case of sublinear,…

Functional Analysis · Mathematics 2022-12-05 Sorin G. Gal , Constantin P. Niculescu

Monotone operators, especially in the form of subdifferential operators, are of basic importance in optimization. It is well known since Minty, Rockafellar, and Bertsekas-Eckstein that in Hilbert space, monotone operators can be understood…

Functional Analysis · Mathematics 2008-10-22 Heinz H. Bauschke , Xianfu Wang , Liangjin Yao

We extend the standard notion of self-concordance to non-convex optimization and develop a family of second-order algorithms with global convergence guarantees. In particular, two function classes -- \textit{weakly self-concordant}…

Optimization and Control · Mathematics 2026-04-07 Donald Goldfarb , Lexiao Lai , Tianyi Lin , Jiayu Zhang

Neural operators have emerged as powerful surrogates for the solution of partial differential equations (PDEs), yet their ability to handle general, highly variable boundary conditions (BCs) remains limited. Existing approaches often fail…

Machine Learning · Computer Science 2026-05-14 Sepehr Mousavi , Siddhartha Mishra , Laura De Lorenzis

Refinement calculus provides a structured framework for the progressive and modular development of programs, ensuring their correctness throughout the refinement process. This paper introduces a refinement calculus tailored for quantum…

Logic in Computer Science · Computer Science 2023-11-27 Yuan Feng , Li Zhou , Yingte Xu

This article improves the triangle inequality for complex numbers, using the Hermite-Hadamard inequality for convex functions. Then, applications of the obtained refinement are presented to include some operator inequalities. The operator…

Functional Analysis · Mathematics 2022-04-19 Shigeru Furuichi , Mohammad Sababheh , Hamid Reza Moradi

Supplying the missing necessary conditions, we complete the characterisation of the $L^p\to L^q$ boundedness of commutators $[b,T]$ of pointwise multiplication and Calder\'on-Zygmund operators, for arbitrary pairs of $1<p,q<\infty$ and…

Classical Analysis and ODEs · Mathematics 2021-10-11 Tuomas P. Hytönen

Probabilistic conditioning is concerned with the identification of a distribution of a random variable $X$ given a random variable $Y$. It is a cornerstone of scientific and engineering applications where modeling uncertainty is key. This…

Machine Learning · Statistics 2026-05-13 Panos Tsimpos , Edoardo Calvello , Ayoub Belhadji , Nicholas H. Nelsen

A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank-$1$ optimal solution that corresponds to an optimal solution of the QCQP. Given a QCQP whose convex relaxation is exact, this paper…

Optimization and Control · Mathematics 2025-10-23 Masakazu Kojima , Sunyoung Kim , Naohiko Arima

The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…

Optimization and Control · Mathematics 2020-11-06 R. Díaz Millán , Nadezda Sukhorukova , Julien Ugon

Contextual refinement (CR) is one of the standard notions of specifying open programs. CR has two main advantages: (i) (horizontal and vertical) compositionality that allows us to decompose a large contextual refinement into many smaller…

Programming Languages · Computer Science 2022-03-16 Youngju Song , Minki Cho , Dongjae Lee , Chung-Kil Hur

The notions of expansivity and positive expansivity for composition operators on Orlicz spaces are investigated. In particular, necessary and sufficient conditions are given for a composition operator to be expansive, positively expansive,…

Functional Analysis · Mathematics 2024-01-23 Z. Huang , Y. Estaremi

In this note we consider weighted conditional type operators between different Orlicz spaces and generalized conditional type Holder inequality that we defined in [2]. Then we give some necessary and sufficient conditions for boundedness of…

Functional Analysis · Mathematics 2015-02-12 Yousef Estaremi

The main result of the paper shows that, for 1<p and 1<=q, a linear operator T from l_p to l_q attains its norm if, and only if, there exists a not weakly null maximizing sequence for T (counterexamples can be easily constructed when p=1).…

Functional Analysis · Mathematics 2015-10-02 Daniel Pellegrino , Eduardo V. Teixeira

Existence of an increasing quasi-concave value function consistent with given preference information is an important issue in various fields including Economics, Multiple Criteria Decision Making, and Applied Mathematics. In this paper, we…

Optimization and Control · Mathematics 2019-09-19 Majid Soleimani-damaneh , Latif Pourkarimi , Pekka J. Korhonen , Jyrki Wallenius

In this article we give a molecular reconstruction theorem for $H_{\omega}^{p(\cdot)}(\mathbb{R}^{n})$. As an application of this result and the atomic decomposition developed in [5] we show that classical singular integrals can be extended…

Classical Analysis and ODEs · Mathematics 2022-12-06 Pablo Rocha

In this note we investigate the two notions of expansivity and strong structural stability for composition operators on $L^p$ spaces, $1 \leq p < \infty$. Necessary and sufficient conditions for such operators to be expansive are provided,…

Dynamical Systems · Mathematics 2022-06-02 Martina Maiuriello

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

Number Theory · Mathematics 2015-01-05 Robert L. Benedetto
‹ Prev 1 4 5 6 7 8 10 Next ›