On the public citation graph
On optimality conditions in nondifferentiable programming
0 signed · 135 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/978-3-642-80684-1openalex-snapshot
Lectures on Mathematical Theory of Extremum Problems
inferredcites →https://doi.org/10.1007/bf00934938openalex-snapshot
On the cones of tangents with applications to mathematical programming
inferredcites →https://doi.org/10.1007/bf01068281openalex-snapshot
A class of almost-differentiable functions and a minimization method for functions of this class
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.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
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/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
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.2000.7263openalex-snapshot
Nonsmooth Invex Functions and Sufficient Optimality Conditions
inferred← citeshttps://doi.org/10.1007/0-387-28020-0_5openalex-snapshot
Optimality Conditions. Preliminary Results
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_6openalex-snapshot
Limiting Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_10openalex-snapshot
Introduction to Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-0348-6721-4_12openalex-snapshot
Numerical Methods for Nonlinear Discrete L1 Approximation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-21114-0_7openalex-snapshot
Nonsmooth Invexities, Invariant Monotonicities and Nonsmooth Vector Variational-Like Inequalities with Applications to Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46709-7_4openalex-snapshot
Convex Directional Derivatives in Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_17openalex-snapshot
A survey on optimality and duality in nonsmooth programming
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_15openalex-snapshot
Generalized Subgradients in Mathematical Programming
inferred← citeshttps://doi.org/10.1007/bf00250804openalex-snapshot
Univalence and degree for Lipschitz continuous maps
inferred← citeshttps://doi.org/10.1007/bf00933503openalex-snapshot
Multiplier rules and the separation of convex sets
inferred← citeshttps://doi.org/10.1007/bf00939984openalex-snapshot
Clarke's tangent vectors as tangents to lipschitz continuous curves
inferred← citeshttps://doi.org/10.1007/bf00962802openalex-snapshot
Superlinear convergence of a trust region-type successive linear programming method
inferred← citeshttps://doi.org/10.1007/bf01259338openalex-snapshot
Solvability results for sublinear functions and operators
inferred← citeshttps://doi.org/10.1007/bf01442544openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming I
inferred← citeshttps://doi.org/10.1007/bf01460130openalex-snapshot
Optimality conditions in nondifferentiable programming and their applications to best approximations
inferred← citeshttps://doi.org/10.1007/bf01580871openalex-snapshot
General constraint qualifications in nondifferentiable programming
inferred← citeshttps://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferred← citeshttps://doi.org/10.1007/bf01588325openalex-snapshot
First and second order conditions for a class of nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf01917172openalex-snapshot
The boundedness of the Lagrange multipliers set and duality in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf02591938openalex-snapshot
Exact penalty functions and stability in locally Lipschitz programming
inferred← citeshttps://doi.org/10.1007/bfb0004502openalex-snapshot
On optimality conditions for infinite programs
inferred← citeshttps://doi.org/10.1007/bfb0004503openalex-snapshot
Optimality conditions for discrete nonlinear norm-approximation problems
inferred← citeshttps://doi.org/10.1007/bfb0120841openalex-snapshot
Differentiable stability in non convex and non differentiable programming
inferred← citeshttps://doi.org/10.1007/bfb0120957openalex-snapshot
Optimality conditions for piecewise smooth functions
inferred← citeshttps://doi.org/10.1007/bfb0120985openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming II
inferred← citeshttps://doi.org/10.1007/bfb0120990openalex-snapshot
Kuhn-tucker multipliers and nonsmooth programs
inferred← citeshttps://doi.org/10.1007/s10479-007-0180-6openalex-snapshot
Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
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-008-9475-2openalex-snapshot
ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints
inferred← citeshttps://doi.org/10.1007/s10957-019-01613-9openalex-snapshot
Optimality Conditions for Nonconvex Nonsmooth Optimization via Global Derivatives
inferred← citeshttps://doi.org/10.1007/s11590-007-0073-2openalex-snapshot
Simplex-inspired algorithms for solving a class of convex programming problems
inferred← citeshttps://doi.org/10.1007/s11590-010-0239-1openalex-snapshot
Nonsmooth ρ − (η, θ)-invexity in multiobjective programming problems
inferred← citeshttps://doi.org/10.1007/s11590-014-0725-yopenalex-snapshot
Second-order necessary conditions in locally Lipschitz optimization with inequality constraints
inferred← citeshttps://doi.org/10.1007/s11590-015-0967-3openalex-snapshot
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
inferred← citeshttps://doi.org/10.1007/s40306-019-00358-xopenalex-snapshot
Optimality Conditions for Approximate Pareto Solutions of a Nonsmooth Vector Optimization Problem with an Infinite Number of Constraints
inferred← citeshttps://doi.org/10.1007/s40840-016-0433-0openalex-snapshot
Saddle Point Criteria in Multiobjective Fractional Programming Involving Exponential Invexity
inferred← citeshttps://doi.org/10.1016/0022-247x(82)90038-5openalex-snapshot
Hadamard's theorem for locally Lipschitzian maps
inferred← citeshttps://doi.org/10.1016/0022-247x(82)90130-5openalex-snapshot
On the Carathéodory-John Multiplier Rule
inferred← citeshttps://doi.org/10.1016/0022-247x(83)90179-8openalex-snapshot
Homeomorphisms and generalized derivatives
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90198-9openalex-snapshot
Global invertibility of nonsmooth mappings
inferred← citeshttps://doi.org/10.1016/0362-546x(87)90005-8openalex-snapshot
A geometric approach to nonsmooth optimization with sample applications
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00106-xopenalex-snapshot
Optimality and duality for generalized fractional programming involving nonsmooth (F, ρ)-convex functions
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50004-1openalex-snapshot
Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.11.002openalex-snapshot
Greedy approaches for a class of nonlinear Generalized Assignment Problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.10.060openalex-snapshot
Solving knapsack problems with S-curve return functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.04.040openalex-snapshot
The stochastic transportation problem with single sourcing
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.12.035openalex-snapshot
Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.05.015openalex-snapshot
The newsvendor problem with capacitated suppliers and quantity discounts
inferred← citeshttps://doi.org/10.1016/j.jfa.2013.10.023openalex-snapshot
KKT conditions for weak ⁎ compact convex sets, theorems of the alternative, and optimality conditions
inferred← citeshttps://doi.org/10.1016/j.na.2007.09.014openalex-snapshot
On constraint qualifications in nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.na.2011.12.013openalex-snapshot
Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential --invexity
inferred← citeshttps://doi.org/10.1016/j.orl.2006.01.010openalex-snapshot
On a nonseparable convex maximization problem with continuous knapsack constraints
inferred← citeshttps://doi.org/10.1016/j.orl.2007.04.001openalex-snapshot
Allocating procurement to capacitated suppliers with concave quantity discounts
inferred← citeshttps://doi.org/10.1016/j.orl.2015.03.009openalex-snapshot
A polynomial time algorithm for convex cost lot-sizing problems
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/s0898-1221(99)00245-xopenalex-snapshot
Three types dual model for minimax fractional programming
inferred← citeshttps://doi.org/10.1017/s0004972700001908openalex-snapshot
Generalized convexity in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s0004972700012041openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s144678870003127xopenalex-snapshot
Generalized differentiability for a class of nondifferentiable operators with applications to nonsmooth optimization
inferred← citeshttps://doi.org/10.1023/a:1004607615343openalex-snapshot
Constraint Qualifications in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/a:1016568309421openalex-snapshot
Recent approaches to global optimization problems through Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1023/a:1020308610005openalex-snapshot
Boris Nicolaevich Pshenichnyi: Two Examples of Influence of His Scientific Works
inferred← citeshttps://doi.org/10.1080/00029890.1980.11995060openalex-snapshot
Modern Multiplier Rules
inferred← citeshttps://doi.org/10.1080/00036818108839364openalex-snapshot
A better insight into the generalized gradient of the absolute value of a function
inferred← citeshttps://doi.org/10.1080/01630563.2010.526408openalex-snapshot
(Φ, ρ)-Invexity in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/01630568608816215openalex-snapshot
Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
inferred← citeshttps://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferred← citeshttps://doi.org/10.1080/01630568908816352openalex-snapshot
Generalized invexity for nonsmooth vector-valued mappings
inferred← citeshttps://doi.org/10.1080/02331930701763645openalex-snapshot
Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
inferred← citeshttps://doi.org/10.1080/02331938608843204openalex-snapshot
An Introduction to the Theory of Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/02331938808843311openalex-snapshot
Regularity, calmness and support principle
inferred← citeshttps://doi.org/10.1080/02331938808843348openalex-snapshot
Abstract cone approximations and generalized differentiability in nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/02331939508844133openalex-snapshot
First–order cone apporximations and necessary optimality conditions
inferred← citeshttps://doi.org/10.1080/02331939608844188openalex-snapshot
Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
inferred← citeshttps://doi.org/10.1080/02331939608844194openalex-snapshot
Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
inferred← citeshttps://doi.org/10.1080/02331939608844224openalex-snapshot
Local second-order approximations and applications in optimization
inferred← citeshttps://doi.org/10.1080/02331939808844382openalex-snapshot
Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
inferred← citeshttps://doi.org/10.1080/02522667.1990.10699019openalex-snapshot
Saddlepoint Problems in Nondifferentiable Programming
inferred← citeshttps://doi.org/10.1080/02522667.1994.10699173openalex-snapshot
Nonsmooth Invexity in Multiobjective Programming
inferred← citeshttps://doi.org/10.1080/03610929008830440openalex-snapshot
Invexity: an updated survey and new results for nonsmooth functions
inferred← citeshttps://doi.org/10.1081/nfa-120006693openalex-snapshot
LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
inferred← citeshttps://doi.org/10.1109/ieem.2009.5373163openalex-snapshot
Particle swarm optimization-based machine arrangement for filling construction of rock-fill dams
inferred← citeshttps://doi.org/10.1109/tac.1985.1103803openalex-snapshot
Optimality conditions and algorithms for parameter design problems with two-level structure
inferred← citeshttps://doi.org/10.1111/itor.12374openalex-snapshot
Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
inferred← citeshttps://doi.org/10.1118/1.3547722openalex-snapshot
Accounting for the tongue‐and‐groove effect using a robust direct aperture optimization approach
inferred← citeshttps://doi.org/10.1137/0320004openalex-snapshot
Second-Order Sufficiency Conditions for Nondifferentiable Programming Problems
inferred← citeshttps://doi.org/10.1137/0324026openalex-snapshot
On the Efficiency and Optimality of Allocations. II
inferred← citeshttps://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferred← citeshttps://doi.org/10.1137/0514060openalex-snapshot
Global Properties of Proper Lipschitzian Maps
inferred← citeshttps://doi.org/10.1137/0727064openalex-snapshot
On the Identification of Active Constraints II: The Nonconvex Case
inferred← citeshttps://doi.org/10.1137/0806011openalex-snapshot
Dini Derivatives of the Marginal Function of a Non-Lipschitzian Program
inferred← citeshttps://doi.org/10.1137/130912190openalex-snapshot
An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming
inferred← citeshttps://doi.org/10.1137/130940037openalex-snapshot
A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1137/15m1037810openalex-snapshot
A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/18m1228608openalex-snapshot
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/s1052623401392111openalex-snapshot
Radial Epiderivatives and Asymptotic Functions in Nonconvex Vector Optimization
inferred← citeshttps://doi.org/10.1137/s1052623499354540openalex-snapshot
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
inferred← citeshttps://doi.org/10.1155/2013/237428openalex-snapshot
Nonsmooth Multiobjective Fractional Programming with Local Lipschitz Exponential B-p,r -Invexity
inferred← citeshttps://doi.org/10.1155/2013/284046openalex-snapshot
Optimality and Duality for Multiobjective Fractional Programming Involving Nonsmooth Generalized (ℱ,b,ϕ,ρ,θ) -Univex Functions
inferred← citeshttps://doi.org/10.1155/s0161171292000085openalex-snapshot
Nonsmooth analysis and optimization on partially ordered vector spaces
inferred← citeshttps://doi.org/10.11650/tjm/240705openalex-snapshot
Approximate Optimality Conditions for Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1201/b15244-11openalex-snapshot
Elements of Variational Inequalities
inferred← citeshttps://doi.org/10.1201/b15244-14openalex-snapshot
Nonsmooth Generalized Variational Inequalities and Optimization Problems
inferred← citeshttps://doi.org/10.1287/mnsc.31.10.1312openalex-snapshot
An Improved Successive Linear Programming Algorithm
inferred← citeshttps://doi.org/10.1287/moor.11.1.70openalex-snapshot
Nonsmooth Milyutin-Dubovitskii Theory and Clarke's Tangent Cone
inferred← citeshttps://doi.org/10.1287/moor.15.4.626openalex-snapshot
On Generalized Gradients in Optimization Problems with Set-Valued Constraints
inferred← citeshttps://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
inferred← citeshttps://doi.org/10.1287/moor.8.2.231openalex-snapshot
Strong and Weak Convexity of Sets and Functions
inferred← citeshttps://doi.org/10.2206/kyushumfs.37.175openalex-snapshot
FIRST-ORDER OPTIMALITY CONDITIONS IN NONDIFFERENTIABLE PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.2298/yjor130131012jopenalex-snapshot
On nonsmooth multiobjective fractional programming problems involving (p, r)− ρ −(η ,θ)- invex functions
inferred← citeshttps://doi.org/10.23952/asvao.8.2026.1.06openalex-snapshot
Sufficient optimality conditions for a separable product quasiconcave programming
inferred← citeshttps://doi.org/10.3906/mat-2011-91openalex-snapshot
Mixed Lagrange function in minimax fractional programming problems
inferred← citeshttps://doi.org/10.9746/sicetr1965.19.130openalex-snapshot
Optimality Conditions for Mathematical Program with Nondifferentiable Functions
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.