A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
From MaRDI portal
Publication:2251574
DOI10.1007/s10957-013-0392-7zbMath1300.90045OpenAlexW1964442167MaRDI QIDQ2251574
Antoine Soubeyran, Kely D. V. Villacorta, Paulo Roberto Oliveira
Publication date: 14 July 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0392-7
trust-region methodsPareto critical pointvariational rationalityworthwhile changesatisficing processunconstrained multiobjective problem
Related Items (16)
Expensive multi-objective optimization of electromagnetic mixing in a liquid metal ⋮ Barzilai and Borwein's method for multiobjective optimization problems ⋮ A Newton-like method for variable order vector optimization problems ⋮ Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization ⋮ Convergence rates of the stochastic alternating algorithm for bi-objective optimization ⋮ A trust-region approach for computing Pareto fronts in multiobjective optimization ⋮ Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems ⋮ Quasi-Newton methods for multiobjective optimization problems ⋮ A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization ⋮ On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization ⋮ Extension of Zoutendijk method for solving constrained multiobjective optimization problems ⋮ Worst-case complexity bounds of directional direct-search methods for multiobjective optimization ⋮ Recent advances in trust region algorithms ⋮ Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
- Local search proximal algorithms as decision dynamics with costs to move
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
- Existence of solutions in variational relation problems without convexity
- A retrospective trust-region method for unconstrained optimization
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Steepest descent methods for multicriteria optimization.
- Maximal elements under reference-dependent preferences with applications to behavioral traps and games
- A tabu search scheme for abstract problems, with applications to the computation of fixed points
- A new trust region method for unconstrained optimization
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- A trust region method using subgradient for minimizing a nondifferentiable function
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Trust Region Algorithm with Memory for Equality Constrained Optimization
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- A Subspace Minimization Method for the Trust-Region Step
- Numerical Optimization
- Trust Region Methods
- Gradient differences and bilateral barters
This page was built for publication: A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
