On the public citation graph
Convex Functions with Unbounded Level Sets and Applications to Duality Theory
0 signed · 56 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/bf00938312openalex-snapshot
Optimal value function in semi-infinite programming
inferredcites →https://doi.org/10.1007/bf00940050openalex-snapshot
Asymptotic properties of the fenchel dual functional and applications to decomposition problems
inferredcites →https://doi.org/10.1007/bf02592017openalex-snapshot
Relaxation methods for problems with strictly convex separable costs and linear constraints
inferredcites →https://doi.org/10.1016/s0294-1449(17)30017-3openalex-snapshot
Well Behaved Asymptotical Convex Functions
inferredcites →https://doi.org/10.1137/0325050openalex-snapshot
Optimization of “$\log x$” Entropy over Linear Equality Constraints
inferredcites →https://doi.org/10.1137/0326019openalex-snapshot
A Parallel Algorithm for a Class of Convex Programs
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.1999.6407openalex-snapshot
Convex Constrained Programmes with Unattained Infima
inferred← citeshttps://doi.org/10.1006/jmaa.1999.6570openalex-snapshot
Lower CS-Closed Sets and Functions
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_3openalex-snapshot
Error Bounds for Convex Inequality Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_1openalex-snapshot
A Comprehensive Survey of Linear Semi-Infinite Optimization Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_20openalex-snapshot
On the Convergence of Some Iterative Methods for Convex Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_4openalex-snapshot
Vector Variational Principles Towards Asymptotically Well Behaved Vector Convex Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_11openalex-snapshot
Which Fixed Point Does the Iteration Method Select?
inferred← citeshttps://doi.org/10.1007/978-3-662-48670-2_8openalex-snapshot
Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem
inferred← citeshttps://doi.org/10.1007/bf00429749openalex-snapshot
A parallel descent algorithm for convex programming
inferred← citeshttps://doi.org/10.1007/bf01027092openalex-snapshot
Convergence of diagonally stationary sequences in convex optimization
inferred← citeshttps://doi.org/10.1007/bf01027112openalex-snapshot
Sur quelques formules de dualit� convexe et non convexe
inferred← citeshttps://doi.org/10.1007/bf01182979openalex-snapshot
Convergence of stationary sequences for variational inequalities with maximal monotone operators
inferred← citeshttps://doi.org/10.1007/bf02614308openalex-snapshot
How to deal with the unbounded in optimization: Theory and algorithms
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf02614358openalex-snapshot
Pseudomonotone variational inequality problems: Existence of solutions
inferred← citeshttps://doi.org/10.1007/bf02680562openalex-snapshot
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
inferred← citeshttps://doi.org/10.1007/s002459900086openalex-snapshot
A General Approach to Convergence Properties of Some Methods for Nonsmooth Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10107-007-0102-zopenalex-snapshot
Nonlinear error bounds for lower semicontinuous functions on metric spaces
inferred← citeshttps://doi.org/10.1007/s10107-007-0132-6openalex-snapshot
Condition numbers and error bounds in convex programming
inferred← citeshttps://doi.org/10.1007/s10957-006-9039-2openalex-snapshot
Existence of Global Minima for Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s40306-017-0209-0openalex-snapshot
Hölder-Type Global Error Bounds for Non-degenerate Polynomial Systems
inferred← citeshttps://doi.org/10.1016/j.orl.2011.12.005openalex-snapshot
Asymptotical good behavior on inequalities with completely approximate K–T concept
inferred← citeshttps://doi.org/10.1016/j.orl.2021.06.004openalex-snapshot
A sufficient condition for asymptotically well behaved property of convex polynomials
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00136-3openalex-snapshot
Cone of recession and unboundedness of convex functions
inferred← citeshttps://doi.org/10.1016/s0764-4442(01)01960-7openalex-snapshot
Well-posedness of variational problems with applications to staircase methods
inferred← citeshttps://doi.org/10.1017/s000497270004034xopenalex-snapshot
Asymptotical well behaviour for constrained minimisation problems
inferred← citeshttps://doi.org/10.1023/a:1004695229456openalex-snapshot
Approximate Efficiency and Scalar Stationarity in Unbounded Nonsmooth Convex Vector Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1020204916793openalex-snapshot
Optimal Hoffman-Type Estimates in Eigenvalue and Semidefinite Inequality Constraints
inferred← citeshttps://doi.org/10.1023/a:1020840322436openalex-snapshot
Well-Posedness by Perturbations of Variational Problems
inferred← citeshttps://doi.org/10.1023/a:1021788625806openalex-snapshot
On Minimizing and Stationary Sequences of a New Class of Merit Functions for Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1023/a:1022646327085openalex-snapshot
Convergence Analysis and Applications of the Glowinski–Le Tallec Splitting Method for Finding a Zero of the Sum of Two Maximal Monotone Operators
inferred← citeshttps://doi.org/10.1023/a:1022691513687openalex-snapshot
Some Convergence Properties of Descent Methods
inferred← citeshttps://doi.org/10.1023/b:coap.0000004979.76493.d4openalex-snapshot
On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets
inferred← citeshttps://doi.org/10.1051/cocv:2004013openalex-snapshot
Characterizations of error bounds for lower semicontinuous functions on metric spaces
inferred← citeshttps://doi.org/10.1051/ro:2003021openalex-snapshot
Coercivity properties and well-posedness in vector optimization
inferred← citeshttps://doi.org/10.1080/01630560701249954openalex-snapshot
Pareto Optimizing and Kuhn–Tucker Stationary Sequences
inferred← citeshttps://doi.org/10.1080/01630560701766684openalex-snapshot
On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
inferred← citeshttps://doi.org/10.1137/23m1545781openalex-snapshot
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
inferred← citeshttps://doi.org/10.1137/s0363012995292548openalex-snapshot
Minimizing and Stationary Sequences of Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1137/s0363012995293645openalex-snapshot
Global Error Bounds for Convex Inequality Systems in Banach Spaces
inferred← citeshttps://doi.org/10.1137/s1052623400375853openalex-snapshot
On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623495288866openalex-snapshot
Convex Analysis of Spectrally Defined Matrix Functions
inferred← citeshttps://doi.org/10.1137/s1052623498341259openalex-snapshot
On Minimizing and Critical Sequences in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1287/moor.21.4.769openalex-snapshot
Noncoercive Optimization Problems
inferred← citeshttps://doi.org/10.12988/ijma.2018.8639openalex-snapshot
Prox-diagonal method: caracterization of the limit
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2800713/v1openalex-snapshot
Global Error Bounds for Linear Semi-infinite System over Polyhedral Constraints
inferred← citeshttps://doi.org/10.58250/jnanabha.2021.51216openalex-snapshot
SOME REMARKS ON THE ASYMPTOTIC BEHAVIOR OF THE SOLUTION SET IN LINEAR OPTIMIZATION
inferred← citeshttps://doi.org/10.58250/jnanabha.2023.53215openalex-snapshot
ON A DUAL CHARACTERIZATION OF THE ASYMPTOTIC CONE FOR THE SOLUTION SET OF A LINEAR OPTIMIZATION PROBLEM
inferred← citeshttps://doi.org/10.68381/jca08003openalex-snapshot
Vector Variational Principles; ε-Efficiency and Scalar Stationarity
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.