Pages that link to "Item:Q4653547"

The following pages link to Polynomial Interior Point Cutting Plane Methods (Q4653547):

Displaying 11 items.

• A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
• Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
• Research on probabilistic methods for control system design (Q2276096) (← links)
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
• A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• (Q5089186) (← links)
• Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs (Q5299910) (← links)