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

Anurag Jayswal; Shalini Jha; Sarita Choudhury

Displaying similar documents to “Saddle point criteria for second order $η$ -approximated vector optimization problems”

Optimization problem under two-sided (max, +)/(min, +) inequality constraints

Karel Zimmermann (2020)

Applications of Mathematics

Similarity:

$(max, +)$ -linear functions are functions which can be expressed as the maximum of a finite number of linear functions of one variable having the form $f (x_{1}, \dots, x_{h}) = {max}_{j} (a_{j} + x_{j})$ , where $a_{j}$ , $j = 1, \dots, h$ , are real numbers. Similarly $(min, +)$ -linear functions are defined. We will consider optimization problems in which the set of feasible solutions is the solution set of a finite inequality system, where the inequalities have $(max, +)$ -linear functions of variables $x$ on one side and $(min, +)$ -linear functions of variables $y$ on the other side....

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

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

Similarity:

Theoretical analysis for $ℓ_{1}$ - $ℓ_{2}$ minimization with partial support information

Haifeng Li, Leiyan Guo (2025)

Applications of Mathematics

Similarity:

We investigate the recovery of $k$ -sparse signals using the $ℓ_{1}$ - $ℓ_{2}$ minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume $k$ -sparse signals $𝐱$ with the prior support $T$ which is composed of $g$ true indices and $b$ wrong...

Properties of unique information

Johannes Rauh, Maik Schünemann, Jürgen Jost (2021)

Kybernetika

Similarity:

We study the unique information function $U I (T : X ∖ Y)$ defined by Bertschinger et al. within the framework of information decompositions. In particular, we study uniqueness and support of the solutions to the convex optimization problem underlying the definition of $U I$ . We identify sufficient conditions for non-uniqueness of solutions with full support in terms of conditional independence constraints and in terms of the cardinalities of $T$ , $X$ and $Y$ . Our results are based on a reformulation of the first...

On a question of Schmidt and Summerer concerning $3$ -systems

Johannes Schleischitz (2020)

Communications in Mathematics

Similarity:

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper $3$ -system $(P_{1}, P_{2}, P_{3})$ with the property ${\bar{ϕ}}_{3} = 1$ . In fact, our method generalizes to provide $n$ -systems with ${\bar{ϕ}}_{n} = 1$ , for arbitrary $n \geq 3$ . We visualize our constructions with graphics. We further present explicit examples of numbers $ξ_{1}, ..., ξ_{n - 1}$ that induce the $n$ -systems in question.

Generalized versions of Ilmanen lemma: Insertion of $C^{1, ω}$ or $C_{loc}^{1, ω}$ functions

Václav Kryštof (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove that for a normed linear space $X$ , if $f_{1} : X \to ℝ$ is continuous and semiconvex with modulus $ω$ , $f_{2} : X \to ℝ$ is continuous and semiconcave with modulus $ω$ and $f_{1} \leq f_{2}$ , then there exists $f \in C^{1, ω} (X)$ such that $f_{1} \leq f \leq f_{2}$ . Using this result we prove a generalization of Ilmanen lemma (which deals with the case $ω (t) = t$ ) to the case of an arbitrary nontrivial modulus $ω$ . This generalization (where a $C_{l o c}^{1, ω}$ function is inserted) gives a positive answer to a problem formulated by A. Fathi and M. Zavidovique in 2010.

Three-space problems for the approximation property

A. Szankowski (2009)

Journal of the European Mathematical Society

Similarity:

It is shown that there is a subspace $Z_{q}$ of $ℓ_{q}$ for $1 < q < 2$ which is isomorphic to $ℓ_{q}$ such that $ℓ_{q} / Z_{q}$ does not have the approximation property. On the other hand, for $2 < p < \infty$ there is a subspace $Y_{p}$ of $ℓ_{p}$ such that $Y_{p}$ does not have the approximation property (AP) but the quotient space $ℓ_{p} / Y_{p}$ is isomorphic to $ℓ_{p}$ . The result is obtained by defining random “Enflo-Davie spaces” $Y_{p}$ which with full probability fail AP for all $2 < p \leq \infty$ and have AP for all $1 \leq p \leq 2$ . For $1 < p \leq 2$ , $Y_{p}$ are isomorphic to $ℓ_{p}$ .

On compactness and connectedness of the paratingent

Wojciech Zygmunt (2016)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

In this note we shall prove that for a continuous function $ϕ : Δ \to ℝ^{n}$ , where $Δ \subset ℝ$ , the paratingent of $ϕ$ at $a \in Δ$ is a non-empty and compact set in $ℝ^{n}$ if and only if $ϕ$ satisfies Lipschitz condition in a neighbourhood of $a$ . Moreover, in this case the paratingent is a connected set.

Displaying similar documents to “Saddle point criteria for second order η -approximated vector optimization problems”

Displaying similar documents to “Saddle point criteria for second order $η$ -approximated vector optimization problems”