Solvability results for sublinear functions and operators
From MaRDI portal
Recommendations
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- A solvability theorem and minimax fractional programming
- On existence of optimal solution for sublinear programs
- Farkas' lemma for separable sublinear inequalities without qualifications
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
Cites work
- A general Farkas lemma
- A generalization of the Alaoglu-Bourbaki theorem and its applications
- A generalization of the Farkas lemma and applications to convex programming
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A Solvability Theorem for Homogeneous Functions
- Adjoint Process Duality
- Approaches to the theory of optimization
- Asymptotic cones and duality of linear relations
- Cones, matrices and mathematical programming
- Convex Analysis
- Differentiable programming in Banach spaces
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3719794 (Why is no real title available?)
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3590940 (Why is no real title available?)
- scientific article; zbMATH DE number 3286429 (Why is no real title available?)
- Letter To The Editor: On Borwein's Paper, “Adjoint Process Duality”
- Nonlinear programming in Banach spaces
- On an abstract control problem
- On minimization subject to cone constraints
- On optimality conditions in nondifferentiable programming
- On regularity conditions in mathematical programming
- Programmings with constraints of convex processes
- Regularity and Stability for Convex Multivalued Functions
- Sur la séparation des ensembles convexes
- Theorems of the alternative and their applications in multiobjective optimization
Cited in
(16)- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- On some open problems in convex analysis
- Some formulae of convex and nonconvex duality
- Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions
- Characterizations of solution sets of convex vector minimization problems
- Contingent derivatives of set-valued maps and applications to vector optimization
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- On existence of optimal solution for sublinear programs
- On the generalized parallel sum of two maximal monotone operators of Gossez type (D)
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Sublinear Equations and Schur’s Test for Integral Operators
- On gwinner's paper "results of emas type"
- Duality and infinite dimensional optimization
- About the maximal monotonicity of the generalized sum of two maximal monotone operators
- General constraint qualifications in nondifferentiable programming
- The conjugate of the pointwise maximum of two convex functions revisited
This page was built for publication: Solvability results for sublinear functions and operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3471115)
