scientific article; zbMATH DE number 3606241

MaRDI QIDQ4171860zbMATH OpenFDO

Authors K.-H. Elster, Rüdiger Reinhardt, Manfred Schäuble, Gerhard Donath

Publication date 1977

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Convex programming (90C25) Nonlinear programming (90C30)

Cited in

(24)

• On stability in multiobjective programming. A stochastic approach
• A price adjustment process in a rationed economy
• Multiobjective duality for convex ratios.
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• Controlled dynamic model with boundary-value problem of minimizing a sensitivity function
• Conjugate duality for multiobjective composed optimization problems
• New constraint qualification and conjugate duality for composed convex optimization problems
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• The method of quasi-solutions based on barrier functions in the analysis of improper convex programs
• On the Convergence of the Fuzzy Clustering Algorithm “Fuzzy ISODATA”
• Construction of Selection Indexes with Restrictions
• A linear separability criterion for sets of Euclidean space
• On the directional derivative of the optimal solution mapping without linear independence constraint qualification
• On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
• Asymptotic analysis of a path-following barrier method for linearly constrained convex problems^*
• Necessary and sufficient conditions for regularity of constraints in convex programming
• A Calculation of all Separating Hyperplanes of two Convex Polytopes
• On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
• Duality for optimization problems with entropy-like objective functions
• A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
• A note on constraint qualification for saddle point conditions involving convex and linear affine functions
• Farkas-type results for max-functions and applications
• Committee polyhedral separability: complexity and polynomial approximation
• A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171860)