Pages that link to "Item:Q1904709"
From MaRDI portal
The following pages link to A logarithmic barrier cutting plane method for convex programming (Q1904709):
Displayed 9 items.
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Optimal joint pricing and lot sizing with fixed and variable capacity (Q1296710) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)