Pages that link to "Item:Q4018838"
From MaRDI portal
The following pages link to An Interior-Point Algorithm for Linearly Constrained Optimization (Q4018838):
Displaying 18 items.
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- Linearly constrained optimization (Q1122324) (← links)
- Determination of an interior feasible point for a system of linear constraints (Q1280896) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
- An interior-point algorithm for solving inverse linear optimization problem (Q2903128) (← links)
- Search for feasible solutions by interior point algorithms (Q2963854) (← links)
- (Q3095964) (← links)
- (Q3370673) (← links)
- (Q3771963) (← links)
- A Low Complexity Interior-Point Algorithm for Linear Programming (Q4018391) (← links)
- (Q4308910) (← links)
- (Q4496016) (← links)
- Partial Affine-Scaling for Linearly Constrained Minimization (Q4864879) (← links)
- A quadratically convergent scaling newton’s method for nonlinear programming problems (Q4944414) (← links)
- A regularized interior-point method for constrained linear least squares (Q5882390) (← links)
- A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)