ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

二レベル最適化(リーダー・フォロワー)×非線形計画法×
分野最適化最適化
系統Process / pipelineProcess / pipeline
提唱年19982006
提唱者Jonathan BardJorge Nocedal & Stephen Wright
種類Hierarchical mathematical programmingContinuous mathematical optimization
原典Bard, J. F. (1998). Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers. ISBN: 978-0-7923-5458-7Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1
別名Stackelberg Optimization, Hierarchical Programming, Nested Optimization, İki Düzeyli OptimizasyonNLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
関連33
概要Bilevel optimization is a class of mathematical programming problems in which one optimization problem is nested inside another. The upper-level (leader) problem optimizes its objective subject to constraints that include the solution of a lower-level (follower) problem. Formalized comprehensively by Jonathan Bard in 1998, the framework models hierarchical decision-making where the leader anticipates and accounts for the rational response of the follower.Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Bilevel Optimization · Nonlinear Programming. 2026-06-15に以下より取得 https://scholargate.app/ja/compare