Bilevel optimization with a multiobjective problem in the lower level
From MaRDI portal
Publication:2424032
DOI10.1007/s11075-018-0576-1zbMath1415.90112OpenAlexW2885943512MaRDI QIDQ2424032
Sandra Augusta Santos, L. D. Secchin, V. A. Ramirez, Roberto Andreani
Publication date: 21 June 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0576-1
numerical experimentsmultiobjective optimizationbilevel optimizationinexact restorationKKT reformulation
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Numerical methods based on nonlinear programming (49M37)
Related Items
Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints, On the Complexity of an Inexact Restoration Method for Constrained Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
Uses Software
Cites Work
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Optimality conditions for vector optimization problems with difference of convex maps
- An inexact-restoration method for nonlinear bilevel programming problems
- An improved definition of proper efficiency for vector maximization with respect to cones
- Nonlinear multiobjective optimization
- A practical optimality condition without constraint qualifications for nonlinear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Inexact-restoration algorithm for constrained optimization
- Semivectorial bilevel optimization problem: penalty approach
- Proper efficiency and the theory of vector maximization
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Proper Efficient Points for Maximizations with Respect to Cones
- Solving mathematical programs with complementarity constraints as nonlinear programs
- The ESA NLP Solver WORHP
- Multicriteria Optimization
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Evolutionary Multi-Criterion Optimization
- Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems
- Optimization over the efficient set
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
