Pages that link to "Item:Q3842985"
From MaRDI portal
The following pages link to Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985):
Displaying 8 items.
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function (Q2271151) (← links)
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
- A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
