We introduce a (possibly infinite) collection of mutually dual nonconvex optimization problems, which share a common optimal value, and give a characterization of their global optimal solutions. As immediate consequences of our general multiduality principle, we obtain Toland–Singer duality theorem as well as an analogous result involving generalized perspective functions. Based on our duality theory, we propose an extension of an existing algorithm for the minimization of d.c. functions, which exploits Toland–Singer duality, to a more general class of nonconvex optimization problems
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
We introduce a (possibly infinite) collection of mutually dual nonconvex optimization problems, whic...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
AbstractThe concept of efficiency is used to formulate duality for nondifferentiable multiobjective ...
A new class of generalized functions d-ρ-η-θ -type I univex is introduced for a nonsmooth multiobjec...
This paper presents a canonical d.c. (difference of canonical and convex functions) programming prob...
AbstractMultiple objective programming problems with the concept of weak minima are extended to mult...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
AbstractA Mond–Weir type dual for a class of nondifferentiable multiobjective variational problems i...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
Abstract This paper presents a canonical dual approach for solving a nonconvex global op-timization ...
AbstractThe basic idea of the reciprocity principle of Tikhonov is to construct, from a given proble...
AbstractWe construct a unified theory of dual optimization problems, which encompasses, as particula...
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
We introduce a (possibly infinite) collection of mutually dual nonconvex optimization problems, whic...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
AbstractThe concept of efficiency is used to formulate duality for nondifferentiable multiobjective ...
A new class of generalized functions d-ρ-η-θ -type I univex is introduced for a nonsmooth multiobjec...
This paper presents a canonical d.c. (difference of canonical and convex functions) programming prob...
AbstractMultiple objective programming problems with the concept of weak minima are extended to mult...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
AbstractA Mond–Weir type dual for a class of nondifferentiable multiobjective variational problems i...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
Abstract This paper presents a canonical dual approach for solving a nonconvex global op-timization ...
AbstractThe basic idea of the reciprocity principle of Tikhonov is to construct, from a given proble...
AbstractWe construct a unified theory of dual optimization problems, which encompasses, as particula...
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...