Pages that link to "Item:Q5219555"

The following pages link to Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555):

Displaying 17 items.

• Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
• Classification in the multiple instance learning framework via spherical separation (Q2152886) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• Minimization of convex functions on the convex hull of a point set (Q2433235) (← links)
• Minimax equalities by reconstruction of polytopes (Q2718674) (← links)
• (Q3335542) (← links)
• A finite algorithm for concave minimization over a polyhedron (Q3705227) (← links)
• Concave Minimization Via Collapsing Polytopes (Q3770289) (← links)
• Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620) (← links)
• Pebble Minimization of Polyregular Functions (Q5145674) (← links)
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (Q5233243) (← links)
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube (Q6155880) (← links)