Farkas' lemma: three decades of generalizations for mathematical optimization
From MaRDI portal
(Redirected from Publication:458935)
Recommendations
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
Cites work
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 823388 (Why is no real title available?)
- scientific article; zbMATH DE number 6128465 (Why is no real title available?)
- scientific article; zbMATH DE number 5245384 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A Farkas lemma Without A Standard Closure Condition
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- A Survey of the S-Lemma
- A closedness condition and its applications to DC programs with convex constraints
- A convex polynomial that is not sos-convex
- A dual condition for the convex subdifferential sum formula with applications
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- A generalization of the Farkas lemma and applications to convex programming
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A new version of Farkas' lemma and global convex maximization
- Adjoint Process Duality
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Duality and infinite dimensional optimization
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Farkas' lemma for separable sublinear inequalities without qualifications
- Farkas-Minkowski systems in semi-infinite programming
- Farkas-type results and duality for DC programs with convex constraints
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Farkas-type theorems for positively homogeneous semi-infinite systems
- Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
- From Hahn--Banach to monotonicity
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Functional inequalities and theorems of the alternative involving composite functions
- Inequality systems and global optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Liberating the subgradient optimality conditions from constraint qualifications
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Mathematical Methods of Economics
- Mathematics of financial markets.
- Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New Farkas-type constraint qualifications in convex infinite programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- New constraint qualification and conjugate duality for composed convex optimization problems
- New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- On systems of convex inequalities
- On the Development of Optimization Theory
- On the Stability of the Feasible Set in Optimization Problems
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Qualification conditions and Farkas-type results for systems involving composite functions
- Results of farkas type
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust linear semi-infinite programming duality under uncertainty
- Semidefinite representation of convex sets
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Some new Farkas-type results for inequality systems with DC functions
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Strong duality in robust convex programming: complete characterizations
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The Hahn–Banach–Lagrange theorem
- Theory and applications of robust optimization
Cited in
(36)- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- New Farkas-type results for vector-valued functions: a non-abstract approach
- General formulation of the S-procedure
- Toward nonquadratic S-lemma: new theory and application in nonconvex optimization
- Some equivalent forms of Farkas lemma and their generalization
- Nonlinear programming via König's maximum theorem
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Efficient and weakly efficient solutions for the vector topical optimization
- Around a Farkas type lemma
- A unified approach to robust Farkas-type results with applications to robust optimization problems
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- General theorems of the alternative in variable ordering structures
- Duality for robust linear infinite programming problems revisited
- Farkas-type results for vector-valued functions with applications
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- An approach to calmness of linear inequality systems from Farkas lemma
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
- Farkas' lemma in the bilinear setting and evaluation functionals
- A discrete variant of Farkas' lemma and related results
- Non-quadratic extension of homogeneous S-lemma and its applications in optimization
- Farkas lemma generalized to the conic linear system
- A discrete variant of Farkas' lemma
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A new approach to strong duality for composite vector optimization problems
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- scientific article; zbMATH DE number 3936941 (Why is no real title available?)
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Some applications of nonnegative linear systems: Farkas strikes again
- Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Robust optimization revisited via robust vector Farkas lemmas
- Negativizability: a useful property for distributed state estimation and control in cyber-physical systems
This page was built for publication: Farkas' lemma: three decades of generalizations for mathematical optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458935)
