On the public citation graph
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
0 signed · 83 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.1007/bf00938588openalex-snapshot
Stability and regular points of inequality systems
inferredcites →https://doi.org/10.1007/bf00940086openalex-snapshot
Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
inferredcites →https://doi.org/10.1007/bf01442543openalex-snapshot
Regularity and stability for the mathematical programming problem in Banach spaces
inferredcites →https://doi.org/10.1007/bf01580871openalex-snapshot
General constraint qualifications in nondifferentiable programming
inferredcites →https://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferredcites →https://doi.org/10.1007/bf01589443openalex-snapshot
A simple constraint qualification in infinite dimensional programming
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
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.1017/s0004972700015276openalex-snapshot
The approximate subdifferential of composite functions
inferredcites →https://doi.org/10.1080/02331939108843709openalex-snapshot
A constraint qualification in quasidifferentiable programming
inferredcites →https://doi.org/10.1112/s0025579300013541openalex-snapshot
Approximate subdifferentials and applications 3: the metric theory
inferredcites →https://doi.org/10.1112/s0025579300013930openalex-snapshot
Approximate subdifferentials and applications II
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.18.2.390openalex-snapshot
Approximations and Metric Regularity in Mathematical Programming in Banach Space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.2001.7705openalex-snapshot
Generalized Constraint Qualifications and Optimality Conditions for Set-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-9640-4_7openalex-snapshot
Metric Regularity and Optimality Conditions in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_2openalex-snapshot
On Regularity for Generalized Systems and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_17openalex-snapshot
On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_4openalex-snapshot
A Second Order Bundle Algorithm for Nonsmooth, Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-00832-0_13openalex-snapshot
Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
inferred← citeshttps://doi.org/10.1007/978-981-10-1768-1_2openalex-snapshot
Bi-Level Decision Making in Random Phenomenon
inferred← citeshttps://doi.org/10.1007/978-981-10-1768-1_4openalex-snapshot
Bi-Level Decision Making in Ra-Fu Phenomenon
inferred← citeshttps://doi.org/10.1007/bf01581135openalex-snapshot
Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems
inferred← citeshttps://doi.org/10.1007/bf02831955openalex-snapshot
Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (θ, η, ρ)-V-invex functions and arbitrary norms
inferred← citeshttps://doi.org/10.1007/s00574-018-00124-xopenalex-snapshot
Necessary Efficiency Conditions for Vector Equilibrium Problems with General Inequality Constraints via Convexificators
inferred← citeshttps://doi.org/10.1007/s10107-013-0633-4openalex-snapshot
On solving simple bilevel programs with a nonconvex lower level program
inferred← citeshttps://doi.org/10.1007/s10107-013-0667-7openalex-snapshot
Enhanced Karush–Kuhn–Tucker condition and weaker constraint qualifications
inferred← citeshttps://doi.org/10.1007/s10107-022-01888-3openalex-snapshot
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
inferred← citeshttps://doi.org/10.1007/s10107980016aopenalex-snapshot
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints
inferred← citeshttps://doi.org/10.1007/s10589-013-9627-7openalex-snapshot
A smoothing augmented Lagrangian method for solving simple bilevel programs
inferred← citeshttps://doi.org/10.1007/s10589-014-9654-zopenalex-snapshot
Solving semi-infinite programs by smoothing projected gradient method
inferred← citeshttps://doi.org/10.1007/s10898-007-9168-7openalex-snapshot
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
inferred← citeshttps://doi.org/10.1007/s10898-014-0242-7openalex-snapshot
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-016-0413-9openalex-snapshot
Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
inferred← citeshttps://doi.org/10.1007/s10898-016-0442-4openalex-snapshot
Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s10898-024-01415-yopenalex-snapshot
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach
inferred← citeshttps://doi.org/10.1007/s10957-006-9155-zopenalex-snapshot
Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/s10957-007-9319-5openalex-snapshot
Generalized (F,ρ)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s10957-009-9644-yopenalex-snapshot
Existence and Boundedness of the Kuhn-Tucker Multipliers in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s10957-010-9744-8openalex-snapshot
The Generalized Mangasarian-Fromowitz Constraint Qualification and Optimality Conditions for Bilevel Programs
inferred← citeshttps://doi.org/10.1007/s10957-013-0510-6openalex-snapshot
New Results on Constraint Qualifications for Nonlinear Extremum Problems and Extensions
inferred← citeshttps://doi.org/10.1007/s10957-014-0699-zopenalex-snapshot
Solving Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/s10957-023-02301-5openalex-snapshot
Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Programming Problems on Hadamard Manifolds
inferred← citeshttps://doi.org/10.1007/s11228-008-0078-8openalex-snapshot
Lagrange Multipliers for Multiobjective Programs with a General Preference
inferred← citeshttps://doi.org/10.1007/s11228-010-0141-0openalex-snapshot
On the Convergence of Coderivative of SAA Solution Mapping for a Parametric Stochastic Generalized Equation
inferred← citeshttps://doi.org/10.1007/s11228-011-0181-0openalex-snapshot
On the Convergence of Coderivative of SAA Solution Mapping for a Parametric Stochastic Variational Inequality
inferred← citeshttps://doi.org/10.1007/s11228-015-0358-zopenalex-snapshot
Necessary Optimality Conditions for Optimal Control Problems with Nonsmooth Mixed State and Control Constraints
inferred← citeshttps://doi.org/10.1007/s11424-015-2233-2openalex-snapshot
Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized (C, α, ρ, d)-convexity
inferred← citeshttps://doi.org/10.1007/s11750-008-0058-zopenalex-snapshot
Strong Kuhn–Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s11766-026-4981-2openalex-snapshot
Optimality analysis for nonsmooth vector equilibrium problems with constraints via generalized subdifferentials
inferred← citeshttps://doi.org/10.1007/s41980-021-00590-yopenalex-snapshot
Optimality Conditions for Efficiency in Locally Lipschitz Vector Equilibrium Problem with Constraints in Terms of Michel–Penot’s Directional Derivatives
inferred← citeshttps://doi.org/10.1007/s41980-024-00904-wopenalex-snapshot
Higher-Order Efficiency Conditions for Vector Nonsmooth Optimization Problems Using the Higher-Order Gâteaux Derivatives
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.02.004openalex-snapshot
Infine functions and nonsmooth multiobjective optimization problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2013.11.011openalex-snapshot
On optimality conditions for vector variational inequalities
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.na.2011.08.054openalex-snapshot
Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00064-1openalex-snapshot
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
inferred← citeshttps://doi.org/10.1016/s0252-9602(08)60085-5openalex-snapshot
The Tangent cones on constraint qualifications in optimization problems
inferred← citeshttps://doi.org/10.1017/s0004972700037473openalex-snapshot
Sufficient conditions for invexity
inferred← citeshttps://doi.org/10.1023/a:1004607615343openalex-snapshot
Constraint Qualifications in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/a:1022662120550openalex-snapshot
Stability of the Solution Set of Perturbed Nonsmooth Inequality Systems and Application
inferred← citeshttps://doi.org/10.1023/a:1022698811948openalex-snapshot
Separation of Sets, Lagrange Multipliers, and Totally Regular Extremum Problems
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1051/ro/2019082openalex-snapshot
Improved enhanced Fritz John condition and constraints qualifications using convexificators
inferred← citeshttps://doi.org/10.1063/5.0139549openalex-snapshot
Nondifferentiable multiobjective semi-infinite programming problems under higher-order convexity
inferred← citeshttps://doi.org/10.1080/01630563.2015.1078813openalex-snapshot
On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331934.2010.539688openalex-snapshot
Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
inferred← citeshttps://doi.org/10.1080/02331934.2017.1337763openalex-snapshot
Convexificators and boundedness of the Kuhn–Tucker multipliers set
inferred← citeshttps://doi.org/10.1080/02331934.2020.1736070openalex-snapshot
Infinite-dimensional vector optimization and a separation theorem
inferred← citeshttps://doi.org/10.1080/02331934.2022.2045987openalex-snapshot
Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
inferred← citeshttps://doi.org/10.1137/23m1569551openalex-snapshot
First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
inferred← citeshttps://doi.org/10.1137/s0363012999358476openalex-snapshot
Multiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
inferred← citeshttps://doi.org/10.1137/s0363012999361718openalex-snapshot
Sensitivity Analysis of the Value Function for Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1137/s1052623403424193openalex-snapshot
Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1137/s105262349834847xopenalex-snapshot
Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1287/moor.1060.0219openalex-snapshot
Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
inferred← citeshttps://doi.org/10.12988/ams.2015.59590openalex-snapshot
Fritz-John type optimality conditions for weak efficient solutions of vector equilibrium problems with constraints in terms of contingent epiderivatives
inferred← citeshttps://doi.org/10.1515/jaa.1998.245openalex-snapshot
Higher–Order Necessary Optimality Conditions for a Nonsmooth Extremum Problem
inferred← citeshttps://doi.org/10.3390/math12203202openalex-snapshot
Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.983openalex-snapshot
On constraint qualifications: Motivation, design and inter-relations
inferred← citeshttps://doi.org/10.5556/j.tkjm.54.2023.3830openalex-snapshot
Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
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.