Adaptive Scalarization Methods in Multiobjective Optimization
From MaRDI portal
Publication:3499423
DOI10.1007/978-3-540-79159-1zbMath1145.90001OpenAlexW641771830MaRDI QIDQ3499423
Publication date: 29 May 2008
Published in: Vector Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79159-1
Multiobjective optimizationPascoletti-Serafini scalarizationAdaptive scalarization methodsMultiobjective bilevel optimization
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Twenty years of continuous multiobjective optimization in the twenty-first century, Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC, Optimising makespan and energy consumption in task scheduling for parallel systems, A trust-region approach for computing Pareto fronts in multiobjective optimization, Optimization over the Pareto front of nonconvex multi-objective optimal control problems, Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems, Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, On high-order model regularization for multiobjective optimization, Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization, A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem, Barzilai and Borwein's method for multiobjective optimization problems, Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Using first-order information in direct multisearch for multiobjective optimization, What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization, Multiobjective approach to optimal control for a tuberculosis model, Quadratic scalarization for decomposed multiobjective optimization, A norm minimization-based convex vector optimization algorithm, Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches, Optimality conditions for a unified vector optimization problem with not necessarily preordering relations, A conic scalarization method in multi-objective optimization, Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach, A quasi-Newton method with Wolfe line searches for multiobjective optimization, Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization, Approximations for Pareto and proper Pareto solutions and their KKT conditions, A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems, Images, fixed points and vector extremum problems, The \(F\)-objective function method for differentiable interval-valued vector optimization problems, Optimal control of normalized SIMR models with vaccination and treatment, An exact algorithm for biobjective integer programming problems, Split algorithms for multiobjective integer programming problems, A numerical method for constructing the Pareto front of multi-objective optimization problems, A new approach to approximate the bounded Pareto front, Computing the Set of Approximate Solutions of a Multi-objective Optimization Problem by Means of Cell Mapping Techniques, Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm, Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems, Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems, Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization, An iterative method for solving a bi-objective constrained portfolio optimization problem, A numerical method for nonconvex multi-objective optimal control problems, An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization, Algorithms to Solve Unbounded Convex Vector Optimization Problems, Existence results and optimization over the set of efficient solutions in vector-valued approximation theory, Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization, Semivectorial bilevel optimization on Riemannian manifolds, Advancements in the computation of enclosures for multi-objective optimization problems, Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods, A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy, Memory gradient method for multiobjective optimization, Efficient solutions in generalized linear vector optimization, An Image Set-Oriented Method for the Numerical Treatment of Bi-Level Multi-objective Optimization Problems, On a practical notion of Geoffrion proper optimality in multicriteria optimization, A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets, Numerical procedures in multiobjective optimization with variable ordering structures, The Pascoletti-Serafini scalarization scheme and linear vector optimization, Characterization of approximate solutions of vector optimization problems with a variable order structure, Equispaced Pareto front construction for constrained bi-objective optimization, Optimal elements in vector optimization with a variable ordering structure, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Computing multiobjective Markov chains handled by the extraproximal method, Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems, Concepts for approximate solutions of vector optimization problems with variable order structures, A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization, On the effects of combining objectives in multi-objective optimization, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, Extension of Zoutendijk method for solving constrained multiobjective optimization problems, Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method, On quadratic scalarization of vector optimization problems in Banach spaces, Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior, Parallel Cell Mapping for Unconstrained Multi-Objective Optimization Problems, A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems, A Memetic Variant of R-NSGA-II for Reference Point Problems, Some Remarks on Bi-level Vector Extremum Problems, Comparison of some scalarization methods in multiobjective optimization, Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy, A radial boundary intersection aided interior point method for multi-objective optimization, On Efficient Solutions with Trade-Offs Bounded by Given Values, A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems, A new scalarization method for finding the efficient frontier in non-convex multi-objective problems, Robust multiobjective optimization \& applications in portfolio optimization, Multiobjective optimization using an adaptive weighting scheme, Global minimum variance portfolios under uncertainty: a robust optimization approach, Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization, Topology of Pareto Sets of Strongly Convex Problems, A Method for Constrained Multiobjective Optimization Based on SQP Techniques, Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone, Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis, Free disposal hull condition to verify when efficiency coincides with weak efficiency, Optimality conditions for vector optimization problems with variable ordering structures, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems, Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach, An augmented Lagrangian algorithm for multi-objective optimization, Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization, A modified direction approach for proper efficiency of multiobjective optimization, Combined gradient methods for multiobjective optimization, Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization, Towards optimal control of concentric tube robots in stereotactic neurosurgery, Methods for Multiobjective Bilevel Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A New Scalarization Technique and New Algorithms to Generate Pareto Fronts, The modified objective-constraint scalarization approach for multiobjective optimization problems, The adaptive parameter control method and linear vector optimization, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case, A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems
Uses Software
