On the public citation graph
Geometry of optimality conditions and constraint qualifications
0 signed · 86 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800080206openalex-snapshot
Constraint qualifications in maximization problems
inferredcites →https://doi.org/10.1002/nav.3800170304openalex-snapshot
On constraint qualifications in nonlinear programming
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_6openalex-snapshot
A Theorem of Fritz John in Mathematical Programming
inferredcites →https://doi.org/10.1007/bf00935506openalex-snapshot
Optimality conditions and constraint qualifications in Banach space
inferredcites →https://doi.org/10.1007/bf01350314openalex-snapshot
Optimization theory in linear spaces
inferredcites →https://doi.org/10.1007/bf01350322openalex-snapshot
Optimization theory in linear spaces. I
inferredcites →https://doi.org/10.1016/0016-0032(60)90869-3openalex-snapshot
Mathematical methods and theory in games, programming and economics
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1080/00401706.1965.10490283openalex-snapshot
Nonlinear and Dynamic Programming
inferredcites →https://doi.org/10.1137/0115028openalex-snapshot
Nonlinear Programming in Banach Space
inferredcites →https://doi.org/10.1137/0120021openalex-snapshot
A Necessary and Sufficient Qualification for Constrained Optimization
inferredcites →https://doi.org/10.1137/0304041openalex-snapshot
Constrained Minimization Problems in Finite-Dimensional Spaces
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1137/0308037openalex-snapshot
Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1287/mnsc.4.1.38openalex-snapshot
Management Models and Industrial Applications of Linear Programming
inferredcites →https://doi.org/10.1515/9781400869930-028openalex-snapshot
A COMPARATIVE STUDY OF NONLINEAR PROGRAMMING CODES
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2342482openalex-snapshot
Mathematical Methods and Theory in Games, Programming, and Economics.
inferredcites →https://doi.org/10.2307/2342801openalex-snapshot
Studies in Linear and Non-Linear Programming.
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
inferredcites →https://doi.org/10.2307/3006897openalex-snapshot
Management Models and Industrial Applications of Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/aic.690190219openalex-snapshot
An optimization algorithm for structured design systems
inferred← citeshttps://doi.org/10.1002/zamm.197405412142openalex-snapshot
Optimierungsprobleme mit nichtlinearen Gleichungsrestriktionen
inferred← citeshttps://doi.org/10.1002/zamm.19900701211openalex-snapshot
On the Connection Between Mechanical Force Equilibrium and Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_3openalex-snapshot
Integer Programming for Telecommunications
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_5openalex-snapshot
Constrained Optimization Problems with Inequality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_6openalex-snapshot
Constrained Optimization Problems with Mixed Constraints
inferred← citeshttps://doi.org/10.1007/978-3-322-89416-8_2openalex-snapshot
Active Constraint Strategies in Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_15openalex-snapshot
First order generalized optimality conditions for programming problems with a set constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-48719-4_5openalex-snapshot
On First Order Sufficient Conditions for Constrained Optima
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5openalex-snapshot
Nondifferentiable Optimization: Motivations and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_16openalex-snapshot
The General Concept of Cone Approximations in Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1007/bf00933129openalex-snapshot
Characterization of optimality in convex programming without a constraint qualification
inferred← citeshttps://doi.org/10.1007/bf00933162openalex-snapshot
On functions whose stationary points are global minima
inferred← citeshttps://doi.org/10.1007/bf00933505openalex-snapshot
Method of reduction in convex programming
inferred← citeshttps://doi.org/10.1007/bf00934908openalex-snapshot
Duality for nonlinear multiple-criteria optimization problems
inferred← citeshttps://doi.org/10.1007/bf00934929openalex-snapshot
A strengthened test for optimality
inferred← citeshttps://doi.org/10.1007/bf00940572openalex-snapshot
A new constraint qualification condition
inferred← citeshttps://doi.org/10.1007/bf01580234openalex-snapshot
Modified regularity conditions for nonlinear programming problems over mixed cone domains
inferred← citeshttps://doi.org/10.1007/bf01581627openalex-snapshot
Geometry of optimality conditions and constraint qualifications: The convex case
inferred← citeshttps://doi.org/10.1007/bf01584322openalex-snapshot
Optimality condition: Constraint regularization
inferred← citeshttps://doi.org/10.1007/bf01585512openalex-snapshot
Various definitions of the derivative in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf01917339openalex-snapshot
Approximation operators in optimization theory
inferred← citeshttps://doi.org/10.1007/bf02671125openalex-snapshot
A constraint qualification for convex programming
inferred← citeshttps://doi.org/10.1007/bf02888778openalex-snapshot
Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
inferred← citeshttps://doi.org/10.1007/bfb0120981openalex-snapshot
Optimality in convex programming: A feasible directions approach
inferred← citeshttps://doi.org/10.1007/bfb0120983openalex-snapshot
Characterizations of optimality without constraint qualification for the abstract convex program
inferred← citeshttps://doi.org/10.1007/bfb0120988openalex-snapshot
On regularity conditions in mathematical programming
inferred← citeshttps://doi.org/10.1007/bfb0120990openalex-snapshot
Kuhn-tucker multipliers and nonsmooth programs
inferred← citeshttps://doi.org/10.1007/s101070050066openalex-snapshot
A note on the convergence of barrier algorithms to second-order necessary points
inferred← citeshttps://doi.org/10.1007/s10589-022-00363-1openalex-snapshot
Derivative-free methods for mixed-integer nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s10898-019-00847-1openalex-snapshot
Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1007/s10957-025-02722-4openalex-snapshot
Characterization of Generalized FJ and KKT Conditions for Robust Optimization
inferred← citeshttps://doi.org/10.1007/s12145-015-0214-6openalex-snapshot
Visually-driven parallel solving of multi-objective land-use allocation problems: a case study in Chelan, Washington
inferred← citeshttps://doi.org/10.1016/0022-247x(81)90138-4openalex-snapshot
Regularizing the abstract convex program
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50003-xopenalex-snapshot
Smooth Optimization Problems. Saddle Point Conditions
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.051openalex-snapshot
Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information
inferred← citeshttps://doi.org/10.1017/s1446788700017250openalex-snapshot
Facial reduction for a cone-convex programming problem
inferred← citeshttps://doi.org/10.1017/s1446788700017882openalex-snapshot
Characterization of optimality for the abstract convex program with finite dimensional range
inferred← citeshttps://doi.org/10.1023/a:1016083601322openalex-snapshot
Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/02331937808842516openalex-snapshot
Differentiability in optimization theory1
inferred← citeshttps://doi.org/10.1080/02331938808843348openalex-snapshot
Abstract cone approximations and generalized differentiability in nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/02331939208843830openalex-snapshot
Necessary and sufficient conditions for regularity of constraints in convex programming
inferred← citeshttps://doi.org/10.1080/10556780410001709420openalex-snapshot
The relation between pseudonormality and quasiregularity in constrained optimization
inferred← citeshttps://doi.org/10.1109/tsmc.2017.2667703openalex-snapshot
Semisupervised Incremental Support Vector Machine Learning Based on Neighborhood Kernel Estimation
inferred← citeshttps://doi.org/10.1137/040603371openalex-snapshot
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
inferred← citeshttps://doi.org/10.1137/070692662openalex-snapshot
A Progressive Barrier for Derivative-Free Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/13094606xopenalex-snapshot
Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications
inferred← citeshttps://doi.org/10.1155/2021/6665168openalex-snapshot
Research on Optimization Model of Logistics Transportation Truck Path considering Environmental Impact: Experimental Data from Xiqing District, Tianjin
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.173openalex-snapshot
A Computational Study of Search Strategies for Mixed Integer Programming
inferred← citeshttps://doi.org/10.24033/msmf.261openalex-snapshot
New concepts in nondifferentiable programming
inferred← citeshttps://doi.org/10.31274/rtd-180813-2806openalex-snapshot
Aspects of quadratic programming with statistical applications
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.983openalex-snapshot
On constraint qualifications: Motivation, design and inter-relations
inferred← citeshttps://doi.org/10.5539/jmr.v9n4p168openalex-snapshot
Minimum Principle-Type Necessary Optimality Conditions in Scalar and Vector Optimization. An Account
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.