A nonmonotone line search method for solving constrained multiobjective optimization problems
From MaRDI portal
Cites work
- A COMPUTATIONAL APPROACH BASED ON THE \epsilon-CONSTRAINT METHOD IN MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
- A method for constrained multiobjective optimization based on SQP techniques
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- A projected gradient method for vector optimization problems
- A sequential quadratic optimization algorithm with rapid infeasibility detection
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A steepest descent method for vector optimization
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- An accelerated proximal gradient method for multiobjective optimization
- An algorithm for solving linearly constrained minimax problems
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- Benchmarking optimization software with performance profiles.
- Conditional gradient method for vector optimization
- Direct Multisearch for Multiobjective Optimization
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- scientific article; zbMATH DE number 2222824 (Why is no real title available?)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Multi-objective optimization using evolutionary algorithms
- Multicriteria Optimization
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Newton's method for multiobjective optimization
- On determining radius in nonmonotone trust-region approaches
- On the nonmonotone line search
- Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
- Steepest descent methods for multicriteria optimization.
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
This page was built for publication: A nonmonotone line search method for solving constrained multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316235)
