Pages that link to "Item:Q535018"

The following pages link to A first-order interior-point method for linearly constrained smooth optimization (Q535018):

Displaying 8 items.

• Standard bi-quadratic optimization problems and unconstrained polynomial reformulations (Q427394) (← links)
• An affine scaling method for optimization problems with polyhedral constraints (Q742300) (← links)
• A partial first-order affine-scaling method (Q1734900) (← links)
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
• An affine scaling method using a class of differential barrier functions: primal approach (Q5085230) (← links)
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
• Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
• Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)