Topology of Pareto sets of strongly convex problems
From MaRDI portal
Publication:4971019
Abstract: A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem. In this paper, we show that strongly convex problems are simplicial under a mild assumption on the ranks of the differentials of the objective mappings. We further prove that one can make any strongly convex problem satisfy the assumption by a generic linear perturbation, provided that the dimension of the source is sufficiently larger than that of the target. We demonstrate that the location problems, a biological modeling, and the ridge regression can be reduced to multiobjective strongly convex problems via appropriate transformations preserving the Pareto ordering and the topology.
Recommendations
Cites work
- scientific article; zbMATH DE number 3150909 (Why is no real title available?)
- scientific article; zbMATH DE number 3826652 (Why is no real title available?)
- scientific article; zbMATH DE number 3674997 (Why is no real title available?)
- scientific article; zbMATH DE number 3461174 (Why is no real title available?)
- scientific article; zbMATH DE number 3545349 (Why is no real title available?)
- scientific article; zbMATH DE number 1768786 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3424863 (Why is no real title available?)
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- Cobordism invariants of fold maps
- Distance-squared mappings
- Global analysis and economics. III: Pareto Optima and price equilibria
- Introductory lectures on convex optimization. A basic course.
- Model Selection and Estimation in Regression with Grouped Variables
- Multicriteria Optimization
- Nonlinear multiobjective optimization
- Nonlinear multiobjective optimization. A generalized homotopy approach
- On the Algebraic Criteria for Local Pareto Optima. II
- On the algebraic criteria for local Pareto optima. I
- On the hierarchical structure of Pareto critical sets
- On the structure of the pareto set of generic mappings
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Scalarization and stability in vector optimization
- Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
- Sparsity and Smoothness Via the Fused Lasso
- Stability and optimization of several functions
- Stability for convex vector optimization problems
- Stability of critical points for vector valued functions and Pareto efficiency
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- Transversality theorems on generic linearly perturbed mappings
- Well-posedness and convexity in vector optimization
Cited in
(6)- Properties of pareto sets in locally convex spaces
- Simpliciality of strongly convex problems
- Comprehensive standard system for generalized mixed module and its application to singularity theory
- Regularities of Pareto sets in low-dimensional practical multi-criteria optimisation problems: analysis, explanation, and exploitation
- The fixed point property in convex multi-objective optimization problem
- A refined transversality theorem on linear perturbations and its applications
This page was built for publication: Topology of Pareto sets of strongly convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971019)
