AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex programs using Gould's (1972) geometric formulation of the dual program. This approach makes the duality theory transparent geometrically and motivates the use of conjugate functions
preprint version The conjugate duality, which states that infx∈X φ(x, 0) = maxv∈Y ′ −φ∗(0, v), when...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractA very powerful approach to duality in mathematical programming is the theory of generalised...
A duality theory using conjugate functions is established for mathematical programs that involve the...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
AbstractThis paper presents a possible generalization of geometric programming problems. Such a gene...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
The conjugate duality, which states that infx∈X φ(x, 0) = maxv∈Y ' −φ∗(0,v), whenever a regularity c...
preprint version The conjugate duality, which states that infx∈X φ(x, 0) = maxv∈Y ′ −φ∗(0, v), when...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractA very powerful approach to duality in mathematical programming is the theory of generalised...
A duality theory using conjugate functions is established for mathematical programs that involve the...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
AbstractThis paper presents a possible generalization of geometric programming problems. Such a gene...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
The conjugate duality, which states that infx∈X φ(x, 0) = maxv∈Y ' −φ∗(0,v), whenever a regularity c...
preprint version The conjugate duality, which states that infx∈X φ(x, 0) = maxv∈Y ′ −φ∗(0, v), when...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
DOI
Add to ORKG