scientific article; zbMATH DE number 269555
From MaRDI portal
Publication:5288434
zbMATH Open0781.65054MaRDI QIDQ5288434FDOQ5288434
Authors: Yu Wang, Tingzhan Liu, Guochen Feng 
Publication date: 18 August 1993
Title of this publication is not available (Why is that?)
Recommendations
complexitydualityconvex nonlinear programmingNewton's methodproximitycentral pathlinear constraintsinterior point algorithmshort step primal dual algorithm
Cited In (24)
- Title not available (Why is that?)
- Optimal mechanism design using interior-point methods
- An interior-point algorithm for solving inverse linear optimization problem
- Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints
- Title not available (Why is that?)
- On some efficient interior point methods for nonlinear convex programming
- A combined homotopy interior point method for convex nonlinear programming
- Title not available (Why is that?)
- A globally convergent interior point algorithm for non-convex nonlinear programming
- A feasible BFGS interior point algorithm for solving convex minimization problems
- On convex optimization with linear constraints
- Substantiation of interior point algorithms
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A combined homotopy interior point method for general nonlinear programming problems
- Search for feasible solutions by interior point algorithms
- A polynomial path following algorithm for convex programming
- Novel interior point algorithms for solving nonlinear convex optimization problems
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An Interior-Point Algorithm for Linearly Constrained Optimization
- Title not available (Why is that?)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Title not available (Why is that?)
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)
