scientific article; zbMATH DE number 3399051
From MaRDI portal
Publication:5666398
Cited in
(30)- Conditions for boundedness in concave programming under reverse convex and convex constraints
- Regularizing the abstract convex program
- 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
- Characterization of optimality in convex programming without a constraint qualification
- Calculating the cone of directions of constancy
- A modified reduced gradient method for dual posynomial programming
- On infeasibility of systems of convex analytic inequalities
- Convex constrained programmes with unattained infima
- Minimal representation of convex regions defined by analytic functions
- Feasible partition problem in reverse convex and convex mixed-integer programming
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- Primal and dual optimality criteria in convex programming
- Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
- scientific article; zbMATH DE number 3948007 (Why is no real title available?)
- Symmetrized Separable Convex Programming
- Geometry of optimality conditions and constraint qualifications: The convex case
- Complete characterization of optimality for convex programming in banach spaces†
- A modified reduced gradient method for a class of nondifferentiable problems
- On A characterization of optimality in convex programming
- Efficiency in multiple objective optimization problems
- Symmetric Duality for Structured Convex Programs
- Feasibility in reverse convex mixed-integer programming
- Irreducible infeasible sets in convex mixed-integer programs
- Preprocessing and regularization for degenerate semidefinite programs
- Unboundedness in reverse convex and concave integer programming
- Numerical decomposition of a convex function
- Some convex programs without a duality gap
- On boundedness of (quasi-)convex integer optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666398)