Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection

DOI10.3934/JIMO.2022029OpenAlexW4226022265MaRDI QIDQ2097485

Nguyen Duc Vuong, Tran Ngoc Thang

Publication date: 14 November 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022029

zbMATH Keywords

global optimizationbranch-and-boundoutcome setmulti-objective semistrictly quasiconcave programmingoptimization over the non-dominated set

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Stochastic programming (90C15)

Related Items (2)

A framework for controllable Pareto front learning with completed scalarization functions and its applications ⋮ A hyper-transformer model for controllable Pareto front learning with split feasibility constraints

Cites Work

• Unnamed Item
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
• Optimization over the efficient set: overview
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
• On efficient sets in \(\mathbb R^2\)
• Mesh shape-quality optimization using the inverse mean-ratio metric
• Decomposition branch and bound algorithm for optimization problems over efficient sets
• Generalized convex multiplicative programming via quasiconcave minimization
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• A convex-concave programming method for optimizing over the efficient set.
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Robust portfolio selection problem under temperature uncertainty
• Reverse polyblock approximation for generalized multiplicative/fractional programming
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
• Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm
• Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
• \(NP\)-hardness of linear multiplicative programming and related problems
• Linear and multiobjective programming with fuzzy stochastic extensions
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• Primal and dual algorithms for optimization over the efficient set
• Algorithms for the vector maximization problem
• Cluster Analysis and Mathematical Programming
• Optimization over the efficient set
• An algorithm for optimizing over the efficient set

This page was built for publication: Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection