On sparsity of approximate solutions to max-plus linear systems

Pingke Li

Displaying similar documents to “On sparsity of approximate solutions to max-plus linear systems”

Exact l $_{1}$ penalty function for nonsmooth multiobjective interval-valued problems

Julie Khatri, Ashish Kumar Prasad (2024)

Kybernetika

Similarity:

Our objective in this article is to explore the idea of an unconstrained problem using the exact l $_{1}$ penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints. First of all, we figure out the KKT-type optimality conditions for the problem (MIVP). Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP $_{ρ}$ ) with the exact l $_{1}$ penalty function. The...

Uniform $L^{1}$ error bounds for semi-discrete finite element solutions of evolutionary integral equations

Lin, Qun, Xu, Da, Zhang, Shuhua

Similarity:

In this paper, we consider the second-order continuous time Galerkin approximation of the solution to the initial problem $u_{t} + \int_{0}^{t} β (t - s) A u (s) d s = 0, u (0) = v, t > 0,$ where A is an elliptic partial-differential operator and $β (t)$ is positive, nonincreasing and log-convex on $(0, \infty)$ with $0 \leq β (\infty) < β (0^{+}) \leq \infty$ . Error estimates are derived in the norm of $L_{t}^{1} (0, \infty; L_{x}^{2})$ , and some estimates for the first order time derivatives of the errors are also given.

Saddle point criteria for second order $η$ -approximated vector optimization problems

Anurag Jayswal, Shalini Jha, Sarita Choudhury (2016)

Kybernetika

Similarity:

The purpose of this paper is to apply second order $η$ -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order $η$ -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order $η$ -saddle point and the second order $η$ -Lagrange function are defined for the second order $η$ -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution...

On the existence of exactly one solution of integral equations in the space $L^{P}$ with a mixed norm

Bogdan Rzepecki (1975)

Annales Polonici Mathematici

Similarity:

The gradient superconvergence of the finite volume method for a nonlinear elliptic problem of nonmonotone type

Tie Zhu Zhang, Shu Hua Zhang (2015)

Applications of Mathematics

Similarity:

We study the superconvergence of the finite volume method for a nonlinear elliptic problem using linear trial functions. Under the condition of $C$ -uniform meshes, we first establish a superclose weak estimate for the bilinear form of the finite volume method. Then, we prove that on the mesh point set $S$ , the gradient approximation possesses the superconvergence: ${max}_{P \in S} | (\nabla u - \bar{\nabla} u_{h}) (P) | = O (h^{2}) {| ln h |}^{3 / 2}$ , where $\bar{\nabla}$ denotes the average gradient on elements containing vertex $P$ . Furthermore, by using the interpolation post-processing...

Interior-point method for large-scale $l_{1}$ optimization

Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan

Similarity:

Linearization techniques for $𝕃^{\infty}$ See PDF-control problems and dynamic programming principles in classical and $𝕃^{\infty}$ See PDF-control problems

Dan Goreac, Oana-Silvia Serea (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The aim of the paper is to provide a linearization approach to the $𝕃^{\infty}$ See PDF-control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the $𝕃^{p}$ See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating $𝕃^{\infty}$ See PDF problems in continuous and...

Erratum to the paper "On the disc theorem" (Ann. Polon. Math. 55 (1991), 1-10)

Cabiria Andreian Cazacu (1992)

Annales Polonici Mathematici

Similarity:

Due to a technical error, part of a sentence was omitted on the top of page 8. The first line should read: “where $f_{p}^{k}$ , $p = a_{l}$ or $b_{l}$ , means the number of folds of the covering $(δ_{k}^{''}, T |, Δ_{l}^{''})$ ending at p, i.e. covering a neighbourhood of p in $a_{l} b_{l}$ without covering p itself”.

Mixed $A_{p} - A_{\infty}$ estimates with one supremum

Andrei K. Lerner, Kabe Moen (2013)

Studia Mathematica

Similarity:

We establish several mixed $A_{p} - A_{\infty}$ bounds for Calderón-Zygmund operators that only involve one supremum. We address both cases when the $A_{\infty}$ part of the constant is measured using the exponential-logarithmic definition and using the Fujii-Wilson definition. In particular, we answer a question of the first author and provide an answer, up to a logarithmic factor, to a conjecture of Hytönen and Lacey. Moreover, we give an example to show that our bounds with the logarithmic factors can be arbitrarily...

An example of the equation $u_{t} = u_{x x} + f (x, t, u)$ with distinct maximum and minimum solutions of a mixed problem

W. Mlak (1963)

Annales Polonici Mathematici

Similarity:

Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials

Didier D&#039;Acunto, Krzysztof Kurdyka (2005)

Annales Polonici Mathematici

Similarity:

Let f: ℝⁿ → ℝ be a polynomial function of degree d with f(0) = 0 and ∇f(0) = 0. Łojasiewicz’s gradient inequality states that there exist C > 0 and ϱ ∈ (0,1) such that ${| \nabla f | \geq C | f |}^{ϱ}$ in a neighbourhood of the origin. We prove that the smallest such exponent ϱ is not greater than $1 - R {(n, d)}^{- 1}$ with $R (n, d) = d {(3 d - 3)}^{n - 1}$ .

Polynomial quotients: Interpolation, value sets and Waring's problem

Zhixiong Chen, Arne Winterhof (2015)

Acta Arithmetica

Similarity:

For an odd prime p and an integer w ≥ 1, polynomial quotients $q_{p, w} (u)$ are defined by $q_{p, w} (u) \equiv (u^{w} - u^{w p}) / p m o d p$ with $0 \leq q_{p, w} (u) \leq p - 1$ , u ≥ 0, which are generalizations of Fermat quotients $q_{p, p - 1} (u)$ . First, we estimate the number of elements $1 \leq u < N \leq p$ for which $f (u) \equiv q_{p, w} (u) m o d p$ for a given polynomial f(x) over the finite field $_{p}$ . In particular, for the case f(x)=x we get bounds on the number of fixed points of polynomial quotients. Second, before we study the problem of estimating the smallest number (called the Waring number) of summands needed to express each...