Pages that link to "Item:Q1029281"

The following pages link to Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281):

Displaying 13 items.

• Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
• Supervised classification and mathematical optimization (Q339559) (← links)
• Efficient max-margin multi-label classification with applications to zero-shot learning (Q439038) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
• A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints (Q1744880) (← links)
• Nonlinear optimization and support vector machines (Q5915690) (← links)