On the public citation graph

Problems of Hierarchical Optimization in Finite Dimensions

0 signed · 77 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-6019-4_3openalex-snapshot
Applications of Proximal Subgradients
inferredcites →https://doi.org/10.1007/978-3-0348-9297-1_13openalex-snapshot
Approximate solutions for two-level optimization problems
inferredcites →https://doi.org/10.1007/b114992openalex-snapshot
Applied Nonlinear Analysis
inferredcites →https://doi.org/10.1007/bf01580720openalex-snapshot
Convex two-level optimization
inferredcites →https://doi.org/10.1007/bf01594944openalex-snapshot
Finite termination of the proximal point algorithm
inferredcites →https://doi.org/10.1007/bf02098173openalex-snapshot
Double penalty method for bilevel optimization problems
inferredcites →https://doi.org/10.1007/bf02346165openalex-snapshot
Exact penalties and sufficient conditions for optimality in nonsmooth optimization
inferredcites →https://doi.org/10.1007/bfb0084934openalex-snapshot
Nonsmooth analysis and parametric optimization
inferredcites →https://doi.org/10.1007/bfb0120850openalex-snapshot
Generalized equations and their solutions, Part I: Basic theory
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1016/0362-546x(83)90033-0openalex-snapshot
Characterization of Clarke's tangent and normal cones in finite and infinite dimensions
inferredcites →https://doi.org/10.1016/0362-546x(85)90012-4openalex-snapshot
Extensions of subgradient calculus with applications to optimization
inferredcites →https://doi.org/10.1016/0362-546x(85)90024-0openalex-snapshot
Lipschitzian properties of multifunctions
inferredcites →https://doi.org/10.1016/0362-546x(94)e0025-copenalex-snapshot
Upper-Lipschitz multifunctions and inverse subdifferentials
inferredcites →https://doi.org/10.1057/jors.1981.156openalex-snapshot
A Representation and Economic Interpretation of a Two-Level Programming Problem
inferredcites →https://doi.org/10.1057/jors.1991.23openalex-snapshot
Linear Bi-level Programming Problems — A Review
inferredcites →https://doi.org/10.1080/02331938708843300openalex-snapshot
Existence theorems of equilibrium points in stackelberg
inferredcites →https://doi.org/10.1109/cdc.1991.261299openalex-snapshot
Optimization of differential inclusions via finite differences
inferredcites →https://doi.org/10.1112/blms/17.5.487openalex-snapshot
APPLIED NONLINEAR ANALYSIS
inferredcites →https://doi.org/10.1112/s0025579300013541openalex-snapshot
Approximate subdifferentials and applications 3: the metric theory
inferredcites →https://doi.org/10.1137/0325045openalex-snapshot
Linear-Quadratic Programming and Optimal Control
inferredcites →https://doi.org/10.1137/0325072openalex-snapshot
Nonsmooth Calculus in Finite Dimensions
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1287/moor.9.1.87openalex-snapshot
Lipschitz Behavior of Solutions to Convex Minimization Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_321openalex-snapshot
Multilevel Methods For Optimal Design
inferred← citeshttps://doi.org/10.1007/0-387-34221-4_1openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_416openalex-snapshot
Multilevel Methods for Optimal Design
inferred← citeshttps://doi.org/10.1007/978-1-4614-5131-0_4openalex-snapshot
Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_20openalex-snapshot
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_416-1openalex-snapshot
Multilevel Methods for Optimal Design
inferred← citeshttps://doi.org/10.1007/978-3-319-92775-6_3openalex-snapshot
Well-Posedness and Coderivative Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-60744-8_8openalex-snapshot
On Exterior Penalties in Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/bf02592205openalex-snapshot
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s001580100115openalex-snapshot
Stochastic bilevel programming in structural optimization
inferred← citeshttps://doi.org/10.1007/s00186-024-00852-5openalex-snapshot
Trilevel and multilevel optimization using monotone operator theory
inferred← citeshttps://doi.org/10.1007/s10898-005-1650-5openalex-snapshot
Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators
inferred← citeshttps://doi.org/10.1007/s10898-007-9154-0openalex-snapshot
Necessary optimality conditions for bilevel set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9468-1openalex-snapshot
Second order optimality conditions for bilevel set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-010-9644-3openalex-snapshot
On linear programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1007/s10898-014-0200-4openalex-snapshot
Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
inferred← citeshttps://doi.org/10.1007/s10957-007-9209-xopenalex-snapshot
Necessary Conditions in Multiobjective Optimization with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/s10957-011-9819-1openalex-snapshot
Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors
inferred← citeshttps://doi.org/10.1007/s10957-012-0046-1openalex-snapshot
Necessary Optimality Conditions and a New Approach to Multiobjective Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11117-017-0511-zopenalex-snapshot
An equivalent one level optimization problem to a semivectorial bilevel problem
inferred← citeshttps://doi.org/10.1007/s11590-019-01443-8openalex-snapshot
New optimality conditions for bilevel programs by using an exact separation principle
inferred← citeshttps://doi.org/10.1016/j.apm.2013.10.003openalex-snapshot
An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
inferred← citeshttps://doi.org/10.1016/j.jmaa.2021.125932openalex-snapshot
Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians
inferred← citeshttps://doi.org/10.1016/j.na.2011.05.097openalex-snapshot
On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problem
inferred← citeshttps://doi.org/10.1016/j.trb.2008.05.001openalex-snapshot
On the applicability and solution of bilevel optimization models in transportation science: A study on the existence, stability and computation of optimal solutions to stochastic mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00052-8openalex-snapshot
Stochastic mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1023/a:1008656806889openalex-snapshot
Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1023/a:1017592429235openalex-snapshot
Exact Penalty Functions for Convex Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1023/b:svan.0000023398.73288.82openalex-snapshot
Necessary Conditions in Nonsmooth Minimization via Lower and Upper Subgradients
inferred← citeshttps://doi.org/10.1080/01630563.2010.505356openalex-snapshot
Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles
inferred← citeshttps://doi.org/10.1080/01630563.2016.1255958openalex-snapshot
Optimality Conditions for Bilevel Vector Optimization Problems with a Variable Ordering Structure
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331930701617551openalex-snapshot
New necessary optimality conditions in optimistic bilevel programming
inferred← citeshttps://doi.org/10.1080/02331930701761508openalex-snapshot
Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
inferred← citeshttps://doi.org/10.1080/02331930802355390openalex-snapshot
Optimization and equilibrium problems with equilibrium constraints in infinite-dimensional spaces
inferred← citeshttps://doi.org/10.1080/02331931003596725openalex-snapshot
Optimality results for a specific bilevel optimization problem
inferred← citeshttps://doi.org/10.1080/02331934.2012.718346openalex-snapshot
A new equivalent single-level problem for bilevel problems
inferred← citeshttps://doi.org/10.1080/02331934.2022.2089036openalex-snapshot
Applying directional upper semi-regular convexificators in bilevel optimization
inferred← citeshttps://doi.org/10.1080/02331939508844060openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1098/rsta.2008.0007openalex-snapshot
Robust bi-level optimization models in transportation science
inferred← citeshttps://doi.org/10.1109/cdc.1994.411006openalex-snapshot
Necessary conditions for bilevel dynamic optimization problems
inferred← citeshttps://doi.org/10.1137/110852528openalex-snapshot
Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
inferred← citeshttps://doi.org/10.1137/s0363012993249717openalex-snapshot
Necessary Conditions for Bilevel Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.1137/s0363012993256150openalex-snapshot
Optimal Strategies For Bilevel Dynamic Problems
inferred← citeshttps://doi.org/10.1137/s0363012996306595openalex-snapshot
Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
inferred← citeshttps://doi.org/10.1137/s0363012999352911openalex-snapshot
A Generalized Mathematical Program with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1137/s1052623400377153openalex-snapshot
On Second-Order Subdifferentials and Their Applications
inferred← citeshttps://doi.org/10.1137/s1052623493257344openalex-snapshot
Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.22.4.977openalex-snapshot
Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1287/moor.24.3.627openalex-snapshot
Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1287/trsc.36.3.271.7826openalex-snapshot
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
inferred← citeshttps://doi.org/10.17535/crorr.2019.0026openalex-snapshot
Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.