A path following algorithm for a class of convex programming problems
From MaRDI portal
Publication:4016864
DOI10.1007/BF01416235zbMath0761.90078OpenAlexW1966090303MaRDI QIDQ4016864
Publication date: 16 January 1993
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01416235
entropy optimizationscaled Lipschitz conditionlinearly constrained convex programming problemsprimal-dual path following interior algorithm
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Analysis of some interior point continuous trajectories for convex programming, Controlled dual perturbations for central path trajectories in geometric programming, AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, A globally convergent primal-dual interior point algorithm for convex programming, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, On controlling the parameter in the logarithmic barrier term for convex programming problems, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints, Interior-point Lagrangian decomposition method for separable convex optimization, A combined homotopy interior point method for general nonlinear programming problems, The curvature integral and the complexity of linear complementarity problems, On the complexity of a combined homotopy interior method for convex programming, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A combined homotopy interior point method for convex nonlinear programming, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*, A noninterior path following algorithm for solving a class of multiobjective programming problems, A polynomial path following algorithm for convex programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, A continuation method for solving convex programming problemsviafischer reformulation, A spline smoothing homotopy method for nonconvex nonlinear programming, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, Long-step primal path-following algorithm for monotone variational inequality problems, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems, An interior point parameterized central path following algorithm for linearly constrained convex programming, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- A long-step barrier method for convex quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On some methods for entropy maximization and matrix scaling
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- M.D.I. estimation via unconstrained convex programming
- Constrained Information Theoretic Characterizations in Consumer Purchase Behaviour
- A Theory of Rational Random Behavior
