Pages that link to "Item:Q1774879"
From MaRDI portal
The following pages link to A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879):
Displaying 10 items.
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- An interior-point algorithm for nonconvex nonlinear programming (Q1294828) (← links)
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) (← links)
- A feasible BFGS interior point algorithm for solving convex minimization problems (Q2706324) (← links)
- Interior‐point method for non‐linear non‐convex optimization (Q3412438) (← links)
- (Q4388292) (← links)
- An interior-point based subgradient method for nondifferentiable convex optimization (Q4946704) (← links)
- Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints (Q5407744) (← links)