Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
From MaRDI portal
Publication:1184526
DOI10.1007/BF02098176zbMath0751.90066MaRDI QIDQ1184526
Panos M. Pardalos, Reiner Horst, Faiz A. Al-Khayyal
Publication date: 28 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Integer programming (90C10) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Hierarchical systems (93A13) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Multilevel decision-making: a survey, Descent approaches for quadratic bilevel programming, A homotopy method for solving bilevel programming problem, Bilevel and multilevel programming: A bibliography review, A penalty method with trust-region mechanism for nonlinear bilevel optimization problem, Bilevel programming in traffic planning: Models, methods and challenge, Basic theoretical foundations and insights on bilevel models and their applications to power systems, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, An overview of bilevel optimization, Semidefinite relaxation for linear programs with equilibrium constraints, A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Parametric integer programming algorithm for bilevel mixed integer programs, Exact penalty functions for convex bilevel programming problems., On the nonlinear multilevel programming problems, Test problem construction for linear bilevel programming problems, The application of nonlinear bilevel programming to the aluminium industry, Developing an integrated model of an aluminium smelter incorporating sub-models with different time bases and levels of aggregation, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- Convex two-level optimization
- Closed-loop Stackelberg solution to a multistage linear-quadratic game
- Dynamic noncooperative game theory
- A solution method for the static constrained Stackelberg problem via penalty method
- An Algorithm for Solving the General Bilevel Programming Problem
- Jointly Constrained Biconvex Programming
- A Multiple Leader Stackelberg Model and Analysis
- The polynomial hierarchy and a simple model for competitive analysis
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Network design problem with congestion effects: A case of bilevel programming
- Global minimization of a difference of two convex functions
- Multiple Objective Mathematical Programming with Respect to Multiple Decision-Makers
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Global Minimization in Nonconvex All-Quadratic Programming
- Multilevel Systems Control and Applications: A Survey
- A Successive Underestimation Method for Concave Minimization Problems
- Leader-follower strategies for multilevel systems
- Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Two-Level Linear Programming
- Programming with a Quadratic Constraint
- Lagrange Multipliers and Nonconvex Programs
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Quadratic programming with quadratic constraints
