Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 02:04, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Farkas' lemma: three decades of generalizations for mathematical optimization	scientific article

Statements

scholarly article

0 references

Farkas' lemma: three decades of generalizations for mathematical optimization (English)

0 references

0 references

D. Rodríguez-Gómez

0 references

0 references

publication date

8 October 2014

0 references

zbMATH Keywords

generalized Farkas' lemma

0 references

optimality

0 references

duality

0 references

mathematical optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11750-014-0319-y

0 references

A convex polynomial that is not sos-convex

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory

0 references

Lectures on Modern Convex Optimization

0 references

Theory and Applications of Robust Optimization

0 references

Adjoint Process Duality

0 references

Farkas-type results for inequality systems with composed convex functions via conjugate duality

0 references

New constraint qualification and conjugate duality for composed convex optimization problems

0 references

Some new Farkas-type results for inequality systems with DC functions

0 references

0 references

0 references

0 references

0 references

A new geometric condition for Fenchel's duality in infinite dimensional spaces

0 references

0 references

Sequential Lagrangian conditions for convex programs with applications to semidefinite programming

0 references

New Farkas-type constraint qualifications in convex infinite programming

0 references

0 references

Qualification and optimality conditions for dc programs with infinite constraints

0 references

Duality and optimality conditions for generalized equilibrium problems involving DC functions

0 references

0 references

Qualification conditions and Farkas-type results for systems involving composite functions

0 references

On the Stability of the Feasible Set in Optimization Problems

0 references

Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization

0 references

Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization

0 references

Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs

0 references

A closedness condition and its applications to DC programs with convex constraints

0 references

Functional inequalities and theorems of the alternative involving composite functions

0 references

Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces

0 references

Mathematics of financial markets.

0 references

Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming

0 references

Mathematical Methods of Economics

0 references

A generalized Farkas lemma with applications to quasidifferentiable programming

0 references

A Farkas lemma for difference sublinear systems and quasidifferentiable programming

0 references

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

0 references

Farkas-Minkowski systems in semi-infinite programming

0 references

Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities

0 references

Robust linear semi-infinite programming duality under uncertainty

0 references

Results of farkas type

0 references

Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)

0 references

On systems of convex inequalities

0 references

Semidefinite representation of convex sets

0 references

Subdifferential calculus using \(\varepsilon\)-subdifferentials

0 references

A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

0 references

Duality and infinite dimensional optimization

0 references

A new version of Farkas' lemma and global convex maximization

0 references

Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares

0 references

Inequality systems and global optimization

0 references

New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

0 references

Liberating the subgradient optimality conditions from constraint qualifications

0 references

Constraint qualifications characterizing Lagrangian duality in convex optimization

0 references

Complete characterizations of stable Farkas' lemma and cone-convex programming duality

0 references

0 references

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

0 references

Farkas' lemma for separable sublinear inequalities without qualifications

0 references

Strong Duality in Robust Convex Programming: Complete Characterizations

0 references

Robust Farkas' lemma for uncertain linear systems with applications

0 references

Characterizing robust set containments and solutions of uncertain linear programs without qualifications

0 references

A new class of alternative theorems for SOS-convex inequalities and robust optimization

0 references

Dual semidefinite programs without duality gaps for a class of convex minimax programs

0 references

A Farkas lemma Without A Standard Closure Condition

0 references

Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems

0 references

Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces

0 references

Farkas-Type results for general composed convex optimization problems with inequality constraints

0 references

Farkas-type theorems for positively homogeneous semi-infinite systems

0 references

0 references

A Survey of the S-Lemma

0 references

On the Development of Optimization Theory

0 references

0 references

From Hahn--Banach to monotonicity

0 references

The Hahn–Banach–Lagrange theorem

0 references

Duality and Farkas-type results for extended Ky Fan inequalities with DC functions

0 references

Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers

0 references

Duality and Farkas-type results for DC fractional programming with DC constraints

0 references

A generalization of the Farkas lemma and applications to convex programming

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S11750-014-0319-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:458935

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q458935&oldid=38115959"