The following pages link to (Q5666398):
Displaying 30 items.
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- Numerical decomposition of a convex function (Q799479) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems (Q1159135) (← links)
- A strengthened test for optimality (Q1159136) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- Characterization of optimality in convex programming without a constraint qualification (Q1226443) (← links)
- Calculating the cone of directions of constancy (Q1240157) (← links)
- A modified reduced gradient method for dual posynomial programming (Q1243245) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Convex constrained programmes with unattained infima (Q1301883) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
- Primal and dual optimality criteria in convex programming (Q3208441) (← links)
- Relación entre conos de direcciones decrecientes y conos de direcciones de descenso (Q3361464) (← links)
- (Q3718492) (← links)
- Symmetrized Separable Convex Programming (Q3869096) (← links)
- Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
- Complete characterization of optimality for convex programming in banach spaces<sup>†</sup> (Q3890447) (← links)
- A modified reduced gradient method for a class of nondifferentiable problems (Q3902833) (← links)
- On A characterization of optimality in convex programming (Q4123086) (← links)
- Efficiency in multiple objective optimization problems (Q4136958) (← links)
- Symmetric Duality for Structured Convex Programs (Q4190445) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
