A path following algorithm for a class of convex programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2201985
- Interior-point methods for convex programming
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- scientific article; zbMATH DE number 1161041
- Interior path following primal-dual algorithms. I: Linear programming
Cites work
- scientific article; zbMATH DE number 45207 (Why is no real title available?)
- scientific article; zbMATH DE number 3504650 (Why is no real title available?)
- A Theory of Rational Random Behavior
- A long-step barrier method for convex quadratic programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Constrained Information Theoretic Characterizations in Consumer Purchase Behaviour
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- M.D.I. estimation via unconstrained convex programming
- On some methods for entropy maximization and matrix scaling
Cited in
(36)- Two interior-point methods for nonlinear P_*()-complementarity problems.
- A continuation method for solving convex programming problemsviafischer reformulation
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
- On the complexity of a combined homotopy interior method for convex programming
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Path-Following Methods for Linear Programming
- A combined homotopy interior point method for convex nonlinear programming
- Long-step primal path-following algorithm for monotone variational inequality problems
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- A noninterior path following algorithm for solving a class of multiobjective programming problems
- The curvature integral and the complexity of linear complementarity problems
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems
- scientific article; zbMATH DE number 2201985 (Why is no real title available?)
- A globally convergent primal-dual interior point algorithm for convex programming
- Interior-point Lagrangian decomposition method for separable convex optimization
- A spline smoothing homotopy method for nonconvex nonlinear programming
- A combined homotopy interior point method for general nonlinear programming problems
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A polynomial path following algorithm for convex programming
- Controlled dual perturbations for central path trajectories in geometric programming
- Volumetric path following algorithms for linear programming
- Several path-following methods for a class of gradient constrained variational inequalities
- AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS
- Homogeneous second-order descent framework: a fast alternative to Newton-type methods
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- scientific article; zbMATH DE number 3892507 (Why is no real title available?)
- Path following in the exact penalty method of convex programming
- Analysis of some interior point continuous trajectories for convex programming
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Basic ANM algorithms for path following problems
This page was built for publication: A path following algorithm for a class of convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016864)
