Pages that link to "Item:Q1904709"
From MaRDI portal
The following pages link to A logarithmic barrier cutting plane method for convex programming (Q1904709):
Displaying 16 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)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481) (← links)
- An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- A projection cutting plane algorithm for convex programming problems (Q1914623) (← 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)
- Two logarithmic barrier methods for convex semi-infinite problems. (Q2776652) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints (Q4806374) (← links)
- Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity<sup>*</sup> (Q4888269) (← links)
