scientific article; zbMATH DE number 4121759
From MaRDI portal
Publication:4735039
zbMath0684.90068MaRDI QIDQ4735039
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergencehomotopy methodmethod of analytic centerscomplexity analysistwo-sided ellipsoidal approximationgeneralized smooth convex programs
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25)
Related Items (13)
Controlled dual perturbations for central path trajectories in geometric programming ⋮ Optimal ellipsoidal approximations around the analytic center ⋮ A new linesearch method for quadratically constrained convex programming ⋮ An interior-point method for multifractional programs with convex constraints ⋮ Potential reduction method for harmonically convex programming ⋮ On some efficient interior point methods for nonlinear convex programming ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming ⋮ Interior-point methods for convex programming ⋮ On the convergence of the method of analytic centers when applied to convex quadratic programs ⋮ Long-step interior-point algorithms for a class of variational inequalities with monotone operators ⋮ Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming ⋮ A potential-reduction variant of Renegar's short-step path-following method for linear programming
This page was built for publication:
