The following pages link to (Q3902815):
Displaying 50 items.
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- Value functions, domination cones and proper efficiency in multicriteria optimization (Q583121) (← links)
- Metric regularity, tangent sets, and second-order optimality conditions (Q583594) (← links)
- Decision principles derived from risk measures (Q661251) (← links)
- Numerical decomposition of a convex function (Q799479) (← links)
- A new dual problem for nondifferentiable convex programming (Q811398) (← links)
- A note on multiple optimality conditions for programs with convex inequality constraints (Q916574) (← links)
- Optimality conditions in nondifferentiable programming and their applications to best approximations (Q1053978) (← links)
- Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications (Q1090615) (← links)
- Semidifferentiable functions and necessary optimality conditions (Q1095801) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
- Duality without a constraint qualification for minimax fractional programming (Q1293955) (← links)
- A simple constraint qualification in convex programming (Q1315427) (← links)
- Calculus for parabolic second-order derivatives (Q1321600) (← links)
- Facial reduction in partially finite convex programming (Q1334956) (← links)
- A saddle-point characterization of Pareto optima (Q1340067) (← links)
- LFS functions in multi-objective programming (Q1363453) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
- Theorems of the alternative and optimality conditions (Q1836144) (← links)
- Partly convex programming and Zermelo's navigation problems (Q1904650) (← links)
- A new algorithm for generalized fractional programs (Q1919091) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Three types dual model for minimax fractional programming (Q1972503) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- An optimality condition for a nondifferentiable convex program (Q3320133) (← links)
- (Q3342228) (← links)
- Relación entre conos de direcciones decrecientes y conos de direcciones de descenso (Q3361464) (← links)
- Implementation of a subgradient projection algorithm II (Q3688108) (← links)
- Nonlinear one-parametric bottleneck linear programming (Q3693286) (← links)
- Input optimization: I. Optimal realizations of mathematical models (Q3718494) (← links)
- A simple constraint qualification in infinite dimensional programming (Q3731366) (← links)
- Characterizing an optimal input in perturbed convex programming: Corrigendum (Q3745634) (← links)
- Input optimization: III. optimal realizations of multiobjective models (Q3760307) (← links)
- New regions of stability in input optimization (Q3815882) (← links)
- Stability of efficiency evaluations in data envelopment analysis (Q3824122) (← links)
- A chain rule for parabolic second-order epiderivatives (Q3835635) (← links)
- (Q3941200) (← links)
- The marginal value formula in input optimization (Q3974420) (← links)
- Stable parametric programming<sup>*</sup> (Q4265530) (← links)
- Mixed duality without a constraint qualification for minimax fractional programming (Q4467183) (← links)
- Finite dimensional second order optimality conditions (Q4733675) (← links)
- Characterizing an optimal input in perturbed convex programming (Q4742581) (← links)
- Necessary and sufficient conditions for quadratic minimality (Q4745640) (← links)
- Optimality and duality without a constraint qualification for minimax programming (Q4807991) (← links)
- Optimality theory for semi-infinite linear programming<sup>∗</sup> (Q4845183) (← links)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
