The following pages link to (Q4171860):
Displayed 23 items.
- A linear separability criterion for sets of Euclidean space (Q368616) (← links)
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function (Q635806) (← links)
- Farkas-type results for max-functions and applications (Q865005) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines (Q915349) (← links)
- On stability in multiobjective programming. A stochastic approach (Q1207315) (← links)
- A price adjustment process in a rationed economy (Q1340079) (← links)
- Multiobjective duality for convex ratios. (Q1856918) (← links)
- Fenchel-Lagrange duality versus geometric duality in convex optimization (Q2370031) (← links)
- Controlled dynamic model with boundary-value problem of minimizing a sensitivity function (Q2421439) (← links)
- Conjugate duality for multiobjective composed optimization problems (Q2460678) (← links)
- New constraint qualification and conjugate duality for composed convex optimization problems (Q2465467) (← links)
- Farkas-type results for inequality systems with composed convex functions via conjugate duality (Q2497401) (← links)
- The method of quasi-solutions based on barrier functions in the analysis of improper convex programs (Q2692754) (← links)
- On the Convergence of the Fuzzy Clustering Algorithm “Fuzzy ISODATA” (Q3030038) (← links)
- Construction of Selection Indexes with Restrictions (Q3680060) (← links)
- On the directional derivative of the optimal solution mapping without linear independence constraint qualification (Q3832337) (← links)
- On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials (Q3979518) (← links)
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> (Q4265517) (← links)
- Necessary and sufficient conditions for regularity of constraints in convex programming (Q4327951) (← links)
- A Calculation of all Separating Hyperplanes of two Convex Polytopes (Q4342958) (← links)
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets (Q4397408) (← links)
- Duality for optimization problems with entropy-like objective functions (Q5694549) (← links)