The following pages link to (Q5583564):
Displaying 28 items.
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- Entering into the domain of feasible solutions using interior point method (Q2290313) (← links)
- Interior point method: history and prospects (Q2300702) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints (Q2357423) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- The Legendre Transformation in Modern Optimization (Q2957720) (← links)
- Interior Point Algorithms in Linear Optimization (Q4553648) (← links)
- (Q4577935) (← links)
- An affine scaling method using a class of differential barrier functions: primal approach (Q5085230) (← links)
- METHOD FOR SEQUENTIAL ACTIVATION OF LIMITATIONS IN LINEAR PROGRAMMING (Q5151238) (← links)
- On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization (Q5347048) (← links)
- An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851) (← links)
- Algorithms associated with arithmetic, geometric and harmonic means and integrable systems (Q5939867) (← links)
- A splitting method for quadratic programming problem (Q5949529) (← links)
- Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit (Q6046301) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport (Q6184262) (← links)
- Spectrally constrained optimization (Q6608071) (← links)
- Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints (Q6644844) (← links)
