On the public citation graph
ε-Optimal solutions in nondifferentiable convex programming and some related questions
0 signed · 112 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-48320-2openalex-snapshot
Test Examples for Nonlinear Programming Codes
inferredcites →https://doi.org/10.1007/978-3-642-61582-5openalex-snapshot
More Test Examples for Nonlinear Programming Codes
inferredcites →https://doi.org/10.1007/bf01582105openalex-snapshot
A stable method for solving certain constrained least squares problems
inferredcites →https://doi.org/10.1007/bf01588966openalex-snapshot
Linearly constrained minimax optimization
inferredcites →https://doi.org/10.1007/bfb0120700openalex-snapshot
An extension of davidon methods to non differentiable problems
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1007/bfb0120851openalex-snapshot
The fixed point approach to nonlinear programming
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferredcites →https://doi.org/10.1070/sm1969v008n02abeh001118openalex-snapshot
APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferredcites →https://doi.org/10.1515/9781400869930-028openalex-snapshot
A COMPARATIVE STUDY OF NONLINEAR PROGRAMMING CODES
inferredcites →https://doi.org/10.7146/math.scand.a-11878openalex-snapshot
Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
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.1996.0080openalex-snapshot
ϵ-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0371openalex-snapshot
Epsilon Approximate Solutions for Multiobjective Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_13openalex-snapshot
Surver of the Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-5233-5_5openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-21114-0_8openalex-snapshot
Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46607-6_45openalex-snapshot
Epsilon Solutions and Duality in Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_27openalex-snapshot
A Perturbed and Inexact Version of the Auxiliary Problem Method for Solving General Variational Inequalities with a Multivalued Operator
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_4openalex-snapshot
Nonlinear Programming Techniques Applied to Stochastic Programs with Recourse
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_14openalex-snapshot
On Duality Theory Related to Approximate Solutions of Vector-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_19openalex-snapshot
Descent Methods for Nonsmooth Convex Constrained Minimization
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_3openalex-snapshot
Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions
inferred← citeshttps://doi.org/10.1007/bf00936165openalex-snapshot
?-solutions in vector minimization problems
inferred← citeshttps://doi.org/10.1007/bf00938593openalex-snapshot
Approximate first-order and second-order directional derivatives of a marginal function in convex optimization
inferred← citeshttps://doi.org/10.1007/bf00940466openalex-snapshot
?-duality theorem of nondifferentiable nonconvex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf00941179openalex-snapshot
Approximate saddle-point theorems in vector optimization
inferred← citeshttps://doi.org/10.1007/bf01027108openalex-snapshot
Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
inferred← citeshttps://doi.org/10.1007/bf01300861openalex-snapshot
Algorithms for the solution of stochastic dynamic minimax problems
inferred← citeshttps://doi.org/10.1007/bf01580582openalex-snapshot
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf01580901openalex-snapshot
ε-optimality criteria for convex programming problems via exact penalty functions
inferred← citeshttps://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf02239973openalex-snapshot
A subgradient selection method for minimizing convex functions subject to linear constraints
inferred← citeshttps://doi.org/10.1007/bf02578991openalex-snapshot
Necessary optimality conditions and saddle points for approximate optimization in banach spaces
inferred← citeshttps://doi.org/10.1007/bf02591738openalex-snapshot
An active set method for solving linearly constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf02592056openalex-snapshot
Penalty functions in ε-programming and ε-minimax problems
inferred← citeshttps://doi.org/10.1007/bf03398619openalex-snapshot
Approximate Saddle Points of Constrained Vector-Valued Games
inferred← citeshttps://doi.org/10.1007/bfb0008364openalex-snapshot
An algorithm for large-scale linearly constrained nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/bfb0008907openalex-snapshot
An algorithm for minimizing nondifferentiable convex functions under linear constraints
inferred← citeshttps://doi.org/10.1007/bfb0066253openalex-snapshot
The approximate first-order and second-order directional derivatives for a convex function
inferred← citeshttps://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-021-01703-5openalex-snapshot
Revisiting augmented Lagrangian duals
inferred← citeshttps://doi.org/10.1007/s10473-020-0320-5openalex-snapshot
On Approximate Efficiency for Nonsmooth Robust Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10898-004-5904-4openalex-snapshot
Multiplier Rules and Saddle-Point Theorems for Helbig’s Approximate Solutions in Convex Pareto Problems
inferred← citeshttps://doi.org/10.1007/s10957-008-9403-5openalex-snapshot
Duality for ε-Variational Inequality
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/s11117-012-0186-4openalex-snapshot
On $${\epsilon}$$ -solutions for convex optimization problems with uncertainty data
inferred← citeshttps://doi.org/10.1007/s11117-017-0549-yopenalex-snapshot
On approximate solutions for robust convex semidefinite optimization problems
inferred← citeshttps://doi.org/10.1007/s11117-022-00952-8openalex-snapshot
On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
inferred← citeshttps://doi.org/10.1007/s11590-018-1292-4openalex-snapshot
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
inferred← citeshttps://doi.org/10.1007/s11750-020-00546-1openalex-snapshot
Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
inferred← citeshttps://doi.org/10.1007/s11750-021-00616-yopenalex-snapshot
An approach to characterizing $$\epsilon $$-solution sets of convex programs
inferred← citeshttps://doi.org/10.1007/s12597-025-00917-xopenalex-snapshot
$$\mathcal {E}$$-LU-pareto solutions for semi-infinite programs with multiple intervals
inferred← citeshttps://doi.org/10.1007/s12597-025-00971-5openalex-snapshot
$$\mathcal {E}$$-LU-optimal solution for nonsmooth semi-infinite interval-valued problems
inferred← citeshttps://doi.org/10.1007/s40096-014-0128-3openalex-snapshot
Sequential optimality conditions for multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.1007/s40305-017-0167-1openalex-snapshot
Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems
inferred← citeshttps://doi.org/10.1016/0021-9045(84)90068-6openalex-snapshot
Best approximation and optimization
inferred← citeshttps://doi.org/10.1016/0096-3003(88)90074-4openalex-snapshot
Strict approximate duality in vector spaces
inferred← citeshttps://doi.org/10.1016/0141-0296(84)90056-7openalex-snapshot
A linearly constrained algorithm not requiring derivative continuity
inferred← citeshttps://doi.org/10.1016/0362-546x(94)00221-3openalex-snapshot
Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00200-2openalex-snapshot
Conditional subgradient optimization — Theory and applications
inferred← citeshttps://doi.org/10.1016/j.aml.2004.02.007openalex-snapshot
A property of efficient and ε -efficient solutions in vector optimization
inferred← citeshttps://doi.org/10.1016/j.jat.2008.03.002openalex-snapshot
ɛ -Optimality conditions for composed convex optimization problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.017openalex-snapshot
A chain rule for ɛ-subdifferentials with applications to approximate solutions in convex Pareto problems
inferred← citeshttps://doi.org/10.1016/s0294-1449(17)30033-1openalex-snapshot
Bundle-Based Decomposition: Conditions for Convergence
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00206-6openalex-snapshot
ε-optimality for multiobjective programming on a Banach space
inferred← citeshttps://doi.org/10.1016/s0893-9659(99)00087-7openalex-snapshot
ϵ-properly efficient solutions to nondifferentiable multiobjective programming problems
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00105-4openalex-snapshot
ε-Optimality and duality for multiobjective fractional programming
inferred← citeshttps://doi.org/10.1023/a:1017960629124openalex-snapshot
Approximate Optimal Solutions and Nonlinear Lagrangian Functions*
inferred← citeshttps://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferred← citeshttps://doi.org/10.1051/ro/1992260302371openalex-snapshot
Méthode du sous-gradient réduit généralisé comme extension du GRG d'Abadie au cas non différentiable
inferred← citeshttps://doi.org/10.1051/ro/1995290201311openalex-snapshot
On a convolution operation obtained by adding level sets : classical and new results
inferred← citeshttps://doi.org/10.1051/ro/2018028openalex-snapshot
ϵ-Efficient solutions in semi-infinite multiobjective optimization
inferred← citeshttps://doi.org/10.1061/(asce)0733-9445(1991)117:12(3570)openalex-snapshot
Two‐Level Approach to Design of Short Concrete Columns
inferred← citeshttps://doi.org/10.1080/01630560500538789openalex-snapshot
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
inferred← citeshttps://doi.org/10.1080/01630560903499845openalex-snapshot
ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
inferred← citeshttps://doi.org/10.1080/01630569408816574openalex-snapshot
∊ -gradients pour les ponctions localements lipschitziennes et applications
inferred← citeshttps://doi.org/10.1080/02331930108844524openalex-snapshot
An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
inferred← citeshttps://doi.org/10.1080/02331930802355234openalex-snapshot
Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
inferred← citeshttps://doi.org/10.1080/02331934.2016.1147037openalex-snapshot
An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
inferred← citeshttps://doi.org/10.1080/02331934.2020.1777124openalex-snapshot
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
inferred← citeshttps://doi.org/10.1080/02331934.2021.1871730openalex-snapshot
Characterizations of robust ε -quasi optimal solutions for nonsmooth optimization problems with uncertain data
inferred← citeshttps://doi.org/10.1080/02331934.2022.2045986openalex-snapshot
On approximate optimality conditions for robust multi-objective convex optimization problems
inferred← citeshttps://doi.org/10.1080/02331938508843041openalex-snapshot
Epsilon-Solutions and Epsilon-Supports
inferred← citeshttps://doi.org/10.1080/02331938608843204openalex-snapshot
An Introduction to the Theory of Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/02331939208843781openalex-snapshot
Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1081/nfa-120023863openalex-snapshot
Approximate Saddle Point and Duality for Multiobjective n -Set Optimization
inferred← citeshttps://doi.org/10.1137/0804038openalex-snapshot
Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
inferred← citeshttps://doi.org/10.1142/s0217595904000199openalex-snapshot
APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
inferred← citeshttps://doi.org/10.1145/3848506openalex-snapshot
Computing Lindahl Equilibrium for Public Goods with and without Funding Caps
inferred← citeshttps://doi.org/10.1155/2010/363012openalex-snapshot
ϵ-Duality Theorems for Convex Semidefinite Optimization Problems with Conic Constraints
inferred← citeshttps://doi.org/10.1155/2011/175327openalex-snapshot
"Equation missing" <!-- No EquationSource Format="TEX", only image -->-Optimal Solutions in Nonconvex Semi-Infinite Programs with Support Functions
inferred← citeshttps://doi.org/10.11650/tjm.13.2009.416openalex-snapshot
On -OPTIMALITY CONDITIONS FOR CONVEX SET-VALUED OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.11650/tjm/240705openalex-snapshot
Approximate Optimality Conditions for Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.11650/twjm/1500405613openalex-snapshot
On $\epsilon$-OPTIMALITY CONDITIONS FOR CONVEX SET-VALUED OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.11650/twjm/1500407131openalex-snapshot
ɛ-OPTIMALITY AND DUALITY FOR FRACTIONAL PROGRAMMING
inferred← citeshttps://doi.org/10.1186/1029-242x-2014-501openalex-snapshot
On ϵ-solutions for robust fractional optimization problems
inferred← citeshttps://doi.org/10.1186/1687-1812-2011-6openalex-snapshot
On ε-optimality conditions for multiobjective fractional optimization problems
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1287/moor.21.3.555openalex-snapshot
Subgradients of Optimal-Value Functions in Dynamic Programming: The Case of Convex Systems Without Optimal Paths
inferred← citeshttps://doi.org/10.1287/opre.1060.0292openalex-snapshot
Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
inferred← citeshttps://doi.org/10.5109/13417openalex-snapshot
$ \varepsilon $-DIRECTIONAL DERIVATIVE OF A MARGINAL FUNCTION IN PARAMETRIZED CONVEX PROGRAMMING
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.