On the public citation graph

Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions

https://doi.org/10.1137/0806021
0 signed · 46 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.1002/1520-6750(199008)37:4<433::aid-nav3220370403>3.0.co;2-2openalex-snapshot
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-6019-4_13openalex-snapshot
From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality
inferredcites →https://doi.org/10.1007/978-3-662-02598-7openalex-snapshot
Global Optimization
inferredcites →https://doi.org/10.1007/978-3-662-06409-2openalex-snapshot
Convex Analysis and Minimization Algorithms II
inferredcites →https://doi.org/10.1007/bf01580893openalex-snapshot
Linear multiplicative programming
inferredcites →https://doi.org/10.1007/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot
Constrained Global Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1016/0893-9659(93)90097-7openalex-snapshot
A new version of Farkas' lemma and global convex maximization
inferredcites →https://doi.org/10.1137/0803042openalex-snapshot
A Global Optimization Algorithm for Concave Quadratic Programming Problems
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

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-306-48332-7_133openalex-snapshot
Farkas lemmaFarkas lemma; Fourier–Motzkin elimination method; Fractional programming; Global optimization: Envelope representation; Gröbner bases for polynomial equations; Lagrangian duality: Basics; Least-index anticycling rules; Theorems of the alternative and optimizationFARKAS LEMMA:…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot
Farkas Lemma: Generalizations
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_4openalex-snapshot
Exhaustive Families of Approximations Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_1openalex-snapshot
An Introduction to Quasidifferential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_12openalex-snapshot
Convex Approximators, Convexificators and Exhausters: Applications to Constrained Extremum Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_3openalex-snapshot
Dual Representations of Classes of Positively Homogeneous Functions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_4openalex-snapshot
Exhausters and Convexificators — New Tools in Nonsmooth Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-58891-4_7openalex-snapshot
Method of H-hyperdifferential Descent
inferred← citeshttps://doi.org/10.1007/s10107-006-0012-5openalex-snapshot
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
inferred← citeshttps://doi.org/10.1007/s10898-007-9179-4openalex-snapshot
Exhausters, optimality conditions and related problems
inferred← citeshttps://doi.org/10.1007/s10898-014-0163-5openalex-snapshot
On minimal representations by a family of sublinear functions
inferred← citeshttps://doi.org/10.1007/s10957-017-1167-3openalex-snapshot
Comparison Between Quasidifferentials and Exhausters
inferred← citeshttps://doi.org/10.1007/s11590-017-1193-yopenalex-snapshot
Efficient and weakly efficient solutions for the vector topical optimization
inferred← citeshttps://doi.org/10.1007/s11750-014-0319-yopenalex-snapshot
Farkas’ lemma: three decades of generalizations for mathematical optimization
inferred← citeshttps://doi.org/10.1016/j.na.2007.09.014openalex-snapshot
On constraint qualifications in nonlinear programming
inferred← citeshttps://doi.org/10.1023/a:1008365206132openalex-snapshot
Conditions for Global Optimality 2
inferred← citeshttps://doi.org/10.1023/a:1008394516838openalex-snapshot
A Dual Representation for Proper Positively Homogeneous Functions
inferred← citeshttps://doi.org/10.1023/b:jota.0000043992.38554.c8openalex-snapshot
Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs
inferred← citeshttps://doi.org/10.1080/02331930500096171openalex-snapshot
Fréchet quasidifferential calculus with applications to metric regularity of continuous maps
inferred← citeshttps://doi.org/10.1080/02331930600815777openalex-snapshot
Optimality conditions in terms of upper and lower exhausters
inferred← citeshttps://doi.org/10.1080/02331934.2010.526713openalex-snapshot
DirectionalK-epiderivatives and error bound
inferred← citeshttps://doi.org/10.1080/02331934.2014.929684openalex-snapshot
Local cone approximations in mathematical programming
inferred← citeshttps://doi.org/10.1080/02331934.2018.1491572openalex-snapshot
The formulas for the representation of functions of two variables as a difference of sublinear functions
inferred← citeshttps://doi.org/10.1080/02331934.2024.2391006openalex-snapshot
Minimally fine exhausters
inferred← citeshttps://doi.org/10.1080/02331939908844424openalex-snapshot
Exhausters af a positively homogeneous function*
inferred← citeshttps://doi.org/10.1080/02331939908844438openalex-snapshot
A fifth bibliography of fractional programming*
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701048openalex-snapshot
Abstract convexity of positively homogeneous functions
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
inferred← citeshttps://doi.org/10.1137/030602332openalex-snapshot
Farkas-Type Results With Conjugate Functions
inferred← citeshttps://doi.org/10.1137/130911287openalex-snapshot
Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
inferred← citeshttps://doi.org/10.1137/s1052623402401944openalex-snapshot
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
inferred← citeshttps://doi.org/10.1142/s021759590700119xopenalex-snapshot
CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
inferred← citeshttps://doi.org/10.1186/s13660-015-0776-3openalex-snapshot
Global optimality conditions for nonconvex minimization problems with quadratic constraints
inferred← citeshttps://doi.org/10.68381/jca02021openalex-snapshot
A General Approach to Dual Characterizations of Solvability of Inequality Systems with Applications
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.