Semivectorial bilevel programming versus scalar bilevel programming
DOI10.1080/02331934.2019.1625900zbMATH Open1453.49003OpenAlexW2952308123WikidataQ127701349 ScholiaQ127701349MaRDI QIDQ5221265FDOQ5221265
Authors: Stephan Dempe, P. Mehlitz
Publication date: 25 March 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1625900
Recommendations
- A solution method for semivectorial bilevel programming problem via penalty method
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
- Methods for Multiobjective Bilevel Optimization
- Bilevel optimization with a multiobjective problem in the lower level
- When semivectorial bilevel optimization reduces to ordinary bilevel optimization
- An exact penalty on bilevel programs with linear vector optimization lower level
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- scientific article; zbMATH DE number 6672398
- An algorithm for the lower bounds of semivectorial bilevel programming problem
- Optimality conditions for pessimistic semivectorial bilevel programming problems
Multi-objective and goal programming (90C29) Existence theories for optimal control problems involving partial differential equations (49J20) Programming in abstract spaces (90C48) Existence theories for problems in abstract spaces (49J27)
Cites Work
- Regularity and stability for the mathematical programming problem in Banach spaces
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- A solution method for semivectorial bilevel programming problem via penalty method
- Semivectorial bilevel optimization problem: penalty approach
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- Optimality conditions for the semivectorial bilevel optimization problem
- Optimization with PDE Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal control of partial differential equations. Theory, methods and applications
- Multicriteria Optimization
- Optimality conditions for semivectorial bilevel convex optimal control problems
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Optimization over the efficient set of multi-objective convex optimal control problems
- Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
- Maximizing a concave function over the efficient or weakly-efficient set
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- Existence theorems in vector optimization
- Solving ill-posed bilevel programs
- Title not available (Why is that?)
- Necessary conditions for nonlinear suboptimization over the weakly- efficient set
- Optimality conditions for minimization over the (weakly or properly) efficient set
- Semivectorial bilevel convex optimal control problems: Existence results
- Optimality conditions for a class of inverse optimal control problems with partial differential equations
- A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing
- A novel penalty function method for semivectorial bilevel programming problem
- Variational analysis and generalized differentiation in optimization and control. In honor of Boris S. Mordukhovich.
- A bilevel approach for parameter learning in inverse problems
- Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints?
- On the sequential normal compactness condition and its restrictiveness in selected function spaces
- Solving inverse optimal control problems via value functions to global optimality
- Necessary optimality conditions for a special class of bilevel programming problems with unique lower level solution
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
Cited In (26)
- A duality approach for a class of semivectorial bilevel programming problems
- Extension of the value function reformulation to multiobjective bilevel optimization
- Gradient-based algorithms for multi-objective bi-level optimization
- Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
- Optimality conditions for semivectorial bilevel convex optimal control problems
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Notes on the value function approach to multiobjective bilevel optimization
- A new exact method for linear bilevel problems with multiple objective functions at the lower level
- Bilevel optimization and variational analysis
- Title not available (Why is that?)
- A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations
- An algorithm for the lower bounds of semivectorial bilevel programming problem
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Methods for Multiobjective Bilevel Optimization
- Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
- Stability for semivectorial bilevel programs
- Semivectorial bilevel convex optimal control problems: Existence results
- Bilevel optimization: theory, algorithms, applications and a bibliography
- When semivectorial bilevel optimization reduces to ordinary bilevel optimization
- On multiobjective bilevel optimization using tangential subdifferentials
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- A bounding approach for the optimistic optimal solution of a class of semivectorial bilevel programming problem
This page was built for publication: Semivectorial bilevel programming versus scalar bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221265)