Pages that link to "Item:Q4579589"

The following pages link to Convex Separable Problems With Linear Constraints in Signal Processing and Communications (Q4579589):

Displaying 8 items.

• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems (Q340685) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• Distributed resource allocation over random networks based on stochastic approximation (Q1643399) (← links)
• On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
• A Unitarily Constrained Total Least Squares Problem in Signal Processing (Q4016792) (← links)
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph (Q5024918) (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
• Advances in Neural Networks – ISNN 2005 (Q5707051) (← links)