A cutting-plane method to nonsmooth multiobjective optimization problems
From MaRDI portal
Publication:1719612
DOI10.1016/j.ejor.2018.12.047zbMath1430.90521OpenAlexW2907702231WikidataQ128636562 ScholiaQ128636562MaRDI QIDQ1719612
Adriano Chaves Lisboa, Douglas Alexandre Gomes Vieira
Publication date: 11 February 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.047
nonsmooth optimizationmultiple objective programmingpseudoconvex functionscutting-plane methodsubdifferencial
Related Items
Network Models for Multiobjective Discrete Optimization ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multicriteria optimization with a multiobjective golden section line search
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Nonlinear multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- Active set strategies in an ellipsoid algorithm for nonlinear programming
- A steepest descent method for vector optimization
- Scalarizing vector optimization problems
- A cutting plane algorithm for convex programming that uses analytic centers
- Nonsmooth multiobjective programming with quasi-Newton methods
- Trust region methods for solving multiobjective optimisation
- Newton's Method for Multiobjective Optimization
- A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
- A Tradeoff Cut Approach to Multiple Objective Optimization
- An ellipsoid algorithm for equality-constrained nonlinear programs
