Duality for almost convex optimization problems via the perturbation approach

@article{Bo2008DualityFA,
  title={Duality for almost convex optimization problems via the perturbation approach},
  author={Radu Ioan Boţ and G{\'a}bor Kassay and Gert Wanka},
  journal={J. Global Optimization},
  year={2008},
  volume={42},
  pages={385-399}
}
We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we need for guaranteeing strong duality are proved to be similar to the ones in the convex case. 

From This Paper

Topics from this paper.
5 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A generalization of Fenchel duality theory

  • C. Beoni
  • Journal of Optimization Theory and Applications
  • 1986
Highly Influential
5 Excerpts

On the relations between different dual problems in convex mathematical programming, In: Operations

  • G. Wanka, R. I. Boţ
  • Research Proceedings
  • 2002
Highly Influential
5 Excerpts

Lagrangian duality and cone convexlike functions

  • J. B. G. Frenk, G. Kassay
  • Journal of Optimization Theory and Applications
  • 2007

Uses of generalized convexity and generalized monotonicity in economics, In: Handbook of Generalized Convexity and Generalized Monotonicity

  • R. John
  • Nonconvex Optimization and and its Applications
  • 2005
1 Excerpt

On the relations between different dual problems in convex mathematical programming

  • G. Wanka, R. I. Boţ
  • 2002

Similar Papers

Loading similar papers…