2018
DOI: 10.1080/02331934.2018.1426583
|View full text |Cite
|
Sign up to set email alerts
|

Approximation of convex bodies by multiple objective optimization and an application in reachable sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
15
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(17 citation statements)
references
References 19 publications
2
15
0
Order By: Relevance
“…A similar observation was made in [12] about the problem studied there. Also here, convexity is not used within the proof, so the claim would hold also for non-convex projection problems.…”
Section: Lemma 2 1 Every Feasible Point (X Y) ∈ S Is a Minimizer Of (8) 2 For The Sets Y And P[s] It Holds Y = Proj −1 [P[s]] And P[s]supporting
confidence: 78%
See 3 more Smart Citations
“…A similar observation was made in [12] about the problem studied there. Also here, convexity is not used within the proof, so the claim would hold also for non-convex projection problems.…”
Section: Lemma 2 1 Every Feasible Point (X Y) ∈ S Is a Minimizer Of (8) 2 For The Sets Y And P[s] It Holds Y = Proj −1 [P[s]] And P[s]supporting
confidence: 78%
“…where the last equality is due to (12). Since the shifted cone {q} + P ∞ is closed, selfboundedness of (8) follows.…”
Section: Proof Of Propositionmentioning
confidence: 98%
See 2 more Smart Citations
“…The following multiobjective convex program is associated to (CPP) (see [1] for a polyhedral prototype of this idea, and [2] for an extension to the non-polyhedral convex case):…”
Section: Introductionmentioning
confidence: 99%