Pages that link to "Item:Q1078076"
From MaRDI portal
The following pages link to Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076):
Displaying 8 items.
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
- Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← links)
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- A fast dual gradient method for separable convex optimization via smoothing (Q2813610) (← links)
- Explicit model of dual programming and solving method for a class of separable convex programming problems (Q5059225) (← links)
- Towards price-based predictive control of a small-scale electricity network (Q5207804) (← links)
- Regularized dual method for nonlinear mathematical programming (Q5438130) (← links)