scientific article; zbMATH DE number 3399051

From MaRDI portal
Publication:5666398

zbMath0252.90046MaRDI QIDQ5666398

R. Tyrrell Rockafellar

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Symmetrized Separable Convex Programming, Symmetric Duality for Structured Convex Programs, Primal and dual optimality criteria in convex programming, Unboundedness in reverse convex and concave integer programming, Regularizing the abstract convex program, Feasibility in reverse convex mixed-integer programming, A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems, A strengthened test for optimality, Method of reduction in convex programming, Irreducible infeasible sets in convex mixed-integer programs, Some convex programs without a duality gap, Feasible partition problem in reverse convex and convex mixed-integer programming, On A characterization of optimality in convex programming, Efficiency in multiple objective optimization problems, Preprocessing and Regularization for Degenerate Semidefinite Programs, Characterization of optimality in convex programming without a constraint qualification, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Calculating the cone of directions of constancy, Unnamed Item, A modified reduced gradient method for dual posynomial programming, Relación entre conos de direcciones decrecientes y conos de direcciones de descenso, Geometry of optimality conditions and constraint qualifications: The convex case, On boundedness of (quasi-)convex integer optimization problems, Conditions for boundedness in concave programming under reverse convex and convex constraints, Complete characterization of optimality for convex programming in banach spaces, A modified reduced gradient method for a class of nondifferentiable problems, Minimal representation of convex regions defined by analytic functions, On infeasibility of systems of convex analytic inequalities, Convex constrained programmes with unattained infima, Numerical decomposition of a convex function