scientific article; zbMATH DE number 269555

MaRDI QIDQ5288434zbMATH OpenFDO

Authors Yu Wang, Tingzhan Liu, Guochen Feng

Publication date 18 August 1993

zbMATH Keywords

complexitydualityconvex nonlinear programmingNewton's methodproximitycentral pathlinear constraintsinterior point algorithmshort step primal dual algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 800120
• On some efficient interior point methods for nonlinear convex programming
• scientific article; zbMATH DE number 1161041
• An interior-point algorithm for nonconvex nonlinear programming

Cited in

(24)

• Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints
• On some efficient interior point methods for nonlinear convex programming
• A combined homotopy interior point method for general nonlinear programming problems
• Search for feasible solutions by interior point algorithms
• scientific article; zbMATH DE number 1047680 (Why is no real title available?)
• Substantiation of interior point algorithms
• Novel interior point algorithms for solving nonlinear convex optimization problems
• scientific article; zbMATH DE number 895357 (Why is no real title available?)
• scientific article; zbMATH DE number 1801376 (Why is no real title available?)
• An Interior-Point Algorithm for Linearly Constrained Optimization
• A combined homotopy interior point method for convex nonlinear programming
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• A feasible BFGS interior point algorithm for solving convex minimization problems
• The empirical performance of a polynomial algorithm for constrained nonlinear optimization
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• On convex optimization with linear constraints
• A polynomial path following algorithm for convex programming
• Optimal mechanism design using interior-point methods
• scientific article; zbMATH DE number 5968557 (Why is no real title available?)
• A globally convergent interior point algorithm for non-convex nonlinear programming
• An interior-point algorithm for solving inverse linear optimization problem
• Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288434)