Approximate Farkas lemma and approximate duality for fractional optimization problems
From MaRDI portal
Cites work
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Approximate duality
- Characterizations of -duality gap statements and -optimality conditions for composite optimization problems with conic constraints
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Characterizations of Farkas lemmas for a class of fractional optimization with DC functions
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Farkas-type results for constrained fractional programming with DC functions
- Farkas-type results for fractional programming problems
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 7108075 (Why is no real title available?)
- On Nonlinear Fractional Programming
- Regularity conditions and Farkas-type results for systems with fractional functions
- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Some dual characterizations of Farkas-type results for fractional programming problems
- Some Farkas-type results for fractional programming problems with DC functions
- The approximate duality gap technique: a unified theory of first-order methods
This page was built for publication: Approximate Farkas lemma and approximate duality for fractional optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997769)
