Pages that link to "Item:Q1174840"

The following pages link to On some efficient interior point methods for nonlinear convex programming (Q1174840):

Displaying 24 items.

• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
• Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
• Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
• An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
• Solving linear systems involved in constrained optimization (Q1902118) (← links)
• On convex optimization with linear constraints (Q1905040) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions (Q2412702) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• Path-following barrier and penalty methods for linearly constrained problems (Q2709451) (← links)
• A spline smoothing homotopy method for nonconvex nonlinear programming (Q2810089) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)