Farkas' lemma: three decades of generalizations for mathematical optimization
From MaRDI portal
Publication:458935
DOI10.1007/s11750-014-0319-yzbMath1330.90104OpenAlexW1982099023WikidataQ60587845 ScholiaQ60587845MaRDI QIDQ458935
J. Herrera, D. Rodríguez-Gómez
Publication date: 8 October 2014
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-014-0319-y
Related Items
Robust optimization revisited via robust vector Farkas lemmas, Farkas-type results for vector-valued functions with applications, Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization, Efficient and weakly efficient solutions for the vector topical optimization, Nonlinear programming via König's maximum theorem, Toward nonquadratic S-lemma: new theory and application in nonconvex optimization, An approach to calmness of linear inequality systems from Farkas lemma, Negativizability: a useful property for distributed state estimation and control in cyber-physical systems, Farkas' lemma in the bilinear setting and evaluation functionals, Non-quadratic extension of homogeneous S-lemma and its applications in optimization, A discrete variant of Farkas' lemma, A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals, Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization, A discrete variant of Farkas' lemma and related results, Duality for robust linear infinite programming problems revisited, Generalized Farkas lemma with adjustable variables and two-stage robust linear programs, A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints, New Farkas-type results for vector-valued functions: a non-abstract approach, Unnamed Item, A new approach to strong duality for composite vector optimization problems, A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems, Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
Cites Work
- Robust linear semi-infinite programming duality under uncertainty
- Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Robust Farkas' lemma for uncertain linear systems with applications
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Mathematics of financial markets.
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- A convex polynomial that is not sos-convex
- Farkas' lemma for separable sublinear inequalities without qualifications
- Functional inequalities and theorems of the alternative involving composite functions
- Semidefinite representation of convex sets
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Liberating the subgradient optimality conditions from constraint qualifications
- Some new Farkas-type results for inequality systems with DC functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Farkas-Minkowski systems in semi-infinite programming
- A generalization of the Farkas lemma and applications to convex programming
- On systems of convex inequalities
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- A new version of Farkas' lemma and global convex maximization
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Inequality systems and global optimization
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Qualification and optimality conditions for dc programs with infinite constraints
- Qualification conditions and Farkas-type results for systems involving composite functions
- New constraint qualification and conjugate duality for composed convex optimization problems
- From Hahn--Banach to monotonicity
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Lectures on Modern Convex Optimization
- Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
- Mathematical Methods of Economics
- On the Stability of the Feasible Set in Optimization Problems
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- A Farkas lemma Without A Standard Closure Condition
- Adjoint Process Duality
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- A closedness condition and its applications to DC programs with convex constraints
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Results of farkas type
- On the Development of Optimization Theory
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Farkas-Type results for general composed convex optimization problems with inequality constraints
- Duality and infinite dimensional optimization
- Farkas-type theorems for positively homogeneous semi-infinite systems
- New Farkas-type constraint qualifications in convex infinite programming
- A Survey of the S-Lemma
- The Hahn–Banach–Lagrange theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
