Pages that link to "Item:Q1122487"

The following pages link to Bundle-based decomposition: Conditions for convergence (Q1122487):

Displaying 8 items.

• An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization (Q1176158) (← links)
• Partitioning mathematical programs for parallel solution (Q1380936) (← links)
• Iterative bundle-based decomposition for large-scale nonseparable convex optimization (Q1806873) (← links)
• Scenario analysis via bundle decomposition (Q1896443) (← links)
• Algorithms for the solution of stochastic dynamic minimax problems (Q1908531) (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
• A direct proof of Conley's decomposition for well-posed hybrid inC30clusions (Q6084724) (← links)