Simpliciality of strongly convex problems

DOI10.2969/JMSJ/83918391MaRDI QIDQ821589zbMATH OpenOpenAlexFDO

Authors Naoki Hamada, Shunsuke Ichiki

Publication date 21 September 2021

Published in Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.09328

zbMATH Keywords

multiobjective optimizationtransversalitysingularity theorygeneric linear perturbationsimplicial problemstrongly convex problem

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Singularities of differentiable mappings in differential topology (57R45)

Abstract: A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the Pareto front of a subproblem, where $0leqrleqinfty$. In the paper titled "Topology of Pareto sets of strongly convex problems," it has been shown that a strongly convex $C^r$ problem is $C^{r-1}$ simplicial under a mild assumption on the ranks of the differentials of the mapping for $2leqrleqinfty$. On the other hand, in this paper, we show that a strongly convex $C^1$ problem is $C^0$ simplicial under the same assumption. Moreover, we establish a specialized transversality theorem on generic linear perturbations of a strongly convex $C^r$ mapping $(rgeq2)$. By the transversality theorem, we also give an application of singularity theory to a strongly convex $C^r$ problem for $2leqrleqinfty$.

Recommendations

• Simplicial convexity and its applications
• Strong convexity and separation theorems
• Some results of convex programming complexity
• scientific article; zbMATH DE number 3855743
• On an extremal problem connected with simplices
• Polyhedral approximations of strictly convex compacta
• Complexity analysis for certain convex programming problems
• scientific article; zbMATH DE number 509206
• Simple convex polytopes and the strong Lefschetz theorem
• Strong hypercomplex convexity

Cites work

• scientific article; zbMATH DE number 3461174 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 3291744 (Why is no real title available?)
• Characterization of generic transversality
• Introductory lectures on convex optimization. A basic course.
• Nonlinear multiobjective optimization
• Topology of Pareto sets of strongly convex problems

Cited in

(2)

• Topology of Pareto sets of strongly convex problems
• A refined transversality theorem on linear perturbations and its applications

This page was built for publication: Simpliciality of strongly convex problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q821589)