On the public citation graph

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

https://doi.org/10.1007/bf02192569

0 signed · 34 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/bf00939737openalex-snapshot

Zero duality gaps in infinite-dimensional programming

inferredcites →https://doi.org/10.1007/bf00939770openalex-snapshot

On necessary optimality conditions in vector optimization problems

inferredcites →https://doi.org/10.1007/bf00939804openalex-snapshot

On necessary and sufficient conditions in vector optimization

inferredcites →https://doi.org/10.1007/bf00939895openalex-snapshot

Proper solutions of vector optimization problems

inferredcites →https://doi.org/10.1007/bf00941316openalex-snapshot

The essence of invexity

inferredcites →https://doi.org/10.1007/bf02192045openalex-snapshot

Invex-convexlike functions and duality

inferredcites →https://doi.org/10.1007/bf02591683openalex-snapshot

Necessary and sufficient conditions in constrained optimization

inferredcites →https://doi.org/10.1016/0022-247x(81)90123-2openalex-snapshot

On sufficiency of the Kuhn-Tucker conditions

inferredcites →https://doi.org/10.1016/0022-247x(88)90113-8openalex-snapshot

Pre-invex functions in multiple objective optimization

inferredcites →https://doi.org/10.1017/s000497270000277xopenalex-snapshot

Generalised convexity and duality in multiple objective programming

inferredcites →https://doi.org/10.1017/s0004972700028604openalex-snapshot

Nonsmooth invexity

inferredcites →https://doi.org/10.1017/s0334270000005142openalex-snapshot

What is invexity?

inferredcites →https://doi.org/10.1017/s0334270000005154openalex-snapshot

Duality with generalized convexity

inferredcites →https://doi.org/10.1017/s1446788700022126openalex-snapshot

Invex functions and duality

inferredcites →https://doi.org/10.1017/s1446788700028937openalex-snapshot

Proper efficiency and duality for vector valued optimization problems

inferredcites →https://doi.org/10.1073/pnas.39.1.42openalex-snapshot

Minimax Theorems

inferredcites →https://doi.org/10.1080/01630568908816337openalex-snapshot

A modified wolfe dual for weak vector minimization

inferredcites →https://doi.org/10.1080/01630568908816352openalex-snapshot

Generalized invexity for nonsmooth vector-valued mappings

inferredcites →https://doi.org/10.1080/01630569108816436openalex-snapshot

Invexity in multifunction optimization

inferredcites →https://doi.org/10.1080/01630569108816453openalex-snapshot

Invex multifunctions and duality

inferredcites →https://doi.org/10.1080/02331938508843061openalex-snapshot

Convexlike alternative theorems and mathematical programming

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-48107-3_2openalex-snapshot

Nonlinear Multiobjective Programming

inferred← citeshttps://doi.org/10.1007/0-387-23393-8_4openalex-snapshot

Generalized Convexity and Optimality Conditions in Scalar and Vector Optimization

inferred← citeshttps://doi.org/10.1007/978-3-642-46854-4_20openalex-snapshot

Sensitivity in Multiobjective Programming by Differential Equations Methods. The case of Homogeneous Functions

inferred← citeshttps://doi.org/10.1007/bf02579021openalex-snapshot

Stochastic measures of arbitrage

inferred← citeshttps://doi.org/10.1007/s11117-022-00889-yopenalex-snapshot

Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity

inferred← citeshttps://doi.org/10.1007/s40324-023-00344-2openalex-snapshot

Set-valued parametric optimization problems with higher-order $$\rho $$-cone arcwise connectedness

inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50006-5openalex-snapshot

Vector Optimization

inferred← citeshttps://doi.org/10.1016/j.camwa.2009.01.012openalex-snapshot

Higher order weak epiderivatives and applications to duality and optimality conditions

inferred← citeshttps://doi.org/10.1016/j.ejor.2011.01.024openalex-snapshot

Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials

inferred← citeshttps://doi.org/10.1023/a:1009753224825openalex-snapshot

On Duality in Nonconvex Vector Optimization in Banach Spaces Using Augmented Lagrangians

inferred← citeshttps://doi.org/10.1186/s13660-022-02792-2openalex-snapshot

Using ρ-cone arcwise connectedness on parametric set-valued optimization problems

inferred← citeshttps://doi.org/10.32508/stdjet.v4isi2.916openalex-snapshot

Optimality conditions and duality with new variants of generalized derivatives and convexity

inferred← citeshttps://doi.org/10.58250/jnanabha.2021.51101openalex-snapshot

PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY

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.