Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case (Q2351525): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-014-0257-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4299552397 / rank | |||
Normal rank | |||
Revision as of 02:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case |
scientific article |
Statements
Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case (English)
0 references
24 June 2015
0 references
This paper presents an algorithm for minimizing a continuous real-valued function \(f\) over the Pareto outcome set of a deterministic bi-objective convex optimization problem (BOP), by evaluating the values of \(f\) on outer approximates of the Pareto outcome set, constructed iteratively. Moreover, in the stochastic framework where the objective functions of (BOP) are given as the expectations of random functions, the authors study the convergence rate and establish error estimates for the method proposed in their previous work [J. Optim. Theory Appl. 162, No. 2, 405--427 (2014; Zbl 1323.90044)].
0 references
bicriteria convex optimization
0 references
optimization over Pareto outcome set
0 references
stochastic bicriteria optimization
0 references
sample average approximation method
0 references
