scientific article
From MaRDI portal
Publication:3780013
zbMath0638.90085MaRDI QIDQ3780013
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
homotopy methodpath followingellipsoidal approximationsglobal rational extrapolationglobalization of Newton's method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Methods of successive quadratic programming type (90C55)
Related Items
Complexity of some cutting plane methods that use analytic centers, Improved branching disjunctions for branch-and-bound: an analytic center approach, A polynomial-time algorithm, based on Newton's method, for linear programming, A simple method for convex optimization in the oracle model, Cutting planes and column generation techniques with the projective algorithm, Complexity estimates of some cutting plane methods based on the analytic barrier, An interior point cutting plane heuristic for mixed integer programming, A corrector-predictor interior-point method with new search direction for linear optimization, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, Solving the discrete \(l_p\)-approximation problem by a method of centers, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Global ellipsoidal approximations and homotopy methods for solving convex analytic programs, Method of centers for minimizing generalized eigenvalues, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Using an interior point method for the master problem in a decomposition approach, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Analytic centers and repelling inequalities, An analytic center cutting plane algorithm for finding equilibrium points, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization
