scientific article; zbMATH DE number 3606241
From MaRDI portal
Publication:4171860
zbMath0389.90063MaRDI QIDQ4171860
Rüdiger Reinhardt, K. H. Elster, Gerhard Donath, Manfred Schäuble
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01)
Related Items (23)
Fenchel-Lagrange duality versus geometric duality in convex optimization ⋮ A price adjustment process in a rationed economy ⋮ Asymptotic analysis of a path-following barrier method for linearly constrained convex problems* ⋮ On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials ⋮ Farkas-type results for max-functions and applications ⋮ A linear separability criterion for sets of Euclidean space ⋮ Committee polyhedral separability: complexity and polynomial approximation ⋮ Controlled dynamic model with boundary-value problem of minimizing a sensitivity function ⋮ Necessary and sufficient conditions for regularity of constraints in convex programming ⋮ The method of quasi-solutions based on barrier functions in the analysis of improper convex programs ⋮ A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function ⋮ A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines ⋮ A Calculation of all Separating Hyperplanes of two Convex Polytopes ⋮ Duality for optimization problems with entropy-like objective functions ⋮ Conjugate duality for multiobjective composed optimization problems ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ On the directional derivative of the optimal solution mapping without linear independence constraint qualification ⋮ On stability in multiobjective programming. A stochastic approach ⋮ On the Convergence of the Fuzzy Clustering Algorithm “Fuzzy ISODATA” ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Farkas-type results for inequality systems with composed convex functions via conjugate duality ⋮ Construction of Selection Indexes with Restrictions ⋮ Multiobjective duality for convex ratios.
This page was built for publication: