Cited in
(57)- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- Conical regularization for multi-objective optimization problems
- Notes on Lipschitz properties of nonlinear scalarization functions with applications
- Bilevel programming for generating discrete representations in multiobjective optimization
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A method for constrained multiobjective optimization based on SQP techniques
- An extension of the non-inferior set estimation algorithm for many objectives
- The adaptive parameter control method and linear vector optimization
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
- ParallAX
- OLAF
- ACRS
- NBI
- Algorithm 695
- CGOPT
- diviz
- JSMAA
- PriEsT
- DecideIT
- Criterium DecisionPlus
- Expert Choice
- M-MACBETH
- OnBalance
- Visual PROMETHEE
- TransparentChoice
- VIP Analysis
- DEXi
- GPGame
- Super Decisions
- FITradeoff
- DFMO
- MOIF
- MODIR
- VIKOR
- ELECTRE III
- MAMCA
- Decisionarium
- Quadratic scalarization for decomposed multiobjective optimization
- Generating equidistant representations in biobjective programming
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Improving the min-max method for multiobjective programming
- Inexact proximal point algorithm for multiobjective optimization
- On the convergence of steepest descent methods for multiobjective optimization
- DESDEO
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Bi-objective dynamic optimization of a nonlinear time-delay system in microbial batch process
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- Reduced Jacobian method
- Efficient algorithms for solving nonlinear fractional programming problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
This page was built for software: ASMO
