All Stories

  1. Some Remarks on Greenberg–Pierskalla Subdifferentiability of Quasiconvex Functions
  2. Preface
  3. A General Nonconvex Multiduality Principle
  4. A subdifferential characterization of Motzkin decomposable functions
  5. Special Issue ‘International Seminar on Optimization and Related Areas’
  6. Closed convex sets of Minkowski type
  7. Special issue of Optimization dedicated to K.-H. Elster and A. Göpfert
  8. Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
  9. Integration of the Fenchel Subdifferentials Revisited
  10. Special issue OPTIMA-2012
  11. γ-Active Constraints
  12. The contribution of K.-H. Elster to generalized conjugation theory and nonconvex duality
  13. Special Issue on recent advances in continuous optimization on the occasion of the 25th European conference on Operational Research (EURO XXV 2012)
  14. Motzkin decomposition of closed convex sets via truncation
  15. Characterization of Lipschitz Continuous Difference of Convex Functions
  16. On Weierstrass extreme value theorem
  17. New results on q-positivity
  18. A convex representation of totally balanced games
  19. Characterization of d.c. functions in terms of quasidifferentials
  20. On the infimum of a quasiconvex vector function over an intersection
  21. The e-support function of an e-convex set and conjugacy for e-convex functions
  22. Preface
  23. Some criteria for maximal abstract monotonicity
  24. On Motzkin decomposable sets and functions
  25. On a Sufficient Condition for Equality of Two Maximal Monotone Operators
  26. Motzkin decomposition of closed convex sets
  27. Preface
  28. Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
  29. Corrigendum to “A tabu search scheme for abstract problems, with applications to the computation of fixed points” [J. Math. Anal. Appl. 338 (2008) 620–627]
  30. A tabu search scheme for abstract problems, with applications to the computation of fixed points
  31. Minimal convex functions bounded below by the duality product
  32. Boundedly connected sets and the distance to the intersection of two sets
  33. Convex solutions of a functional equation arising in information theory
  34. Preface
  35. Duality for Equilibrium Problems
  36. Some conjugation formulas and subdifferential formulas of convex analysis revisited
  37. A contribution to duality theory, applied to the measurement of risk aversion
  38. Farkas-type theorems for positively homogeneous semi-infinite systems
  39. Increasing quasiconcave co-radiant functions with applications in mathematical economics
  40. Monotone Operators Representable by l.s.c. Convex Functions
  41. Monotonic analysis over cones: II
  42. Book review
  43. Monotonic Analysis over Cones: I
  44. New formulas for the Legendre–Fenchel transform
  45. Characterizations of evenly convex sets and evenly quasiconvex functions
  46. An Appropriate Subdifferential for Quasiconvex Functions
  48. Duality For D.C. Optimization Over Compact Sets
  49. Generalized Convexity and Generalized Monotonicity
  50. Forword
  51. Duality in D.C. Programming: The Case of Several D.C. Constraints
  52. On φ-convexity of convex functions
  53. Generalized Convexity, Generalized Monotonicity: Recent Results
  54. Simplified Global Optimality Conditions in Generalized Conjugation Theory
  55. Characterization of R-Evenly Quasiconvex Functions
  56. Book Reviews
  57. Book reviews
  58. ?-Subdifferentials in terms of subdifferentials
  59. On expenditure functions
  60. Subdifferentials with respect to dualities
  61. Yuan's alternative theorem and the maximization of the minimum eigenvalue function
  62. A general cone decomposition theory based on efficiency
  63. Dualities
  64. Some characterizations of perturbational dual problems
  65. Duality between direct and indirect preferences
  66. Lower subdifferentiability of quadratic functions
  67. Axiomatic characterizations of the duality correspondence in consumer theory
  68. Compatible preorders and linear operators on Rn
  69. Characterizations of efficient solutions under polyhedrality assumptions
  70. Fractional programming by lower subdifferentiability techniques
  71. Lexicographical order, lexicographical index, and linear operators
  72. The structure of hemispaces in Rn
  73. Lexicographical order and duality in multiobjective programming
  74. Lexicographical separation in Rn
  75. Level sets and the minimal time function of linear control processes
  76. Surrogate duality for vector optimization
  77. Exact quasiconvex conjugation
  78. Some Characterizations of Convex Games
  79. Generalized Convex Duality and its Economic Applicatons