Pages that link to "Item:Q1330897"
From MaRDI portal
The following pages link to A globally convergent primal-dual interior point algorithm for convex programming (Q1330897):
Displaying 18 items.
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) (← links)
- On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm (Q1196215) (← links)
- Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach (Q1294549) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- On the convergence of the iteration sequence in primal-dual interior- point methods (Q1804356) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- An interior trust region algorithm for solving linearly constrained nonlinear optimization (Q2504105) (← links)
- A Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization (Q2991816) (← links)
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323) (← links)
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925) (← links)
- A circular cone relaxation primal interior point algorithm for LP (Q4467177) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
