Pages that link to "Item:Q1205507"

The following pages link to Interior-point methods for convex programming (Q1205507):

Displaying 50 items.

• An interior point method for constrained saddle point problems (Q539681) (← links)
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
• On the relationship of interior-point methods (Q687866) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
• On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
• Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
• Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
• On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
• Optimal ellipsoidal approximations around the analytic center (Q1330921) (← links)
• Asymptotic analysis of the exponential penalty trajectory in linear programming (Q1341567) (← links)
• Interior point methods of mathematical programming (Q1353361) (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
• Infinite-dimensional quadratic optimization: Interior-point methods and control applications (Q1363637) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
• Topics in semidefinite and interior-point methods (Q1386876) (← links)
• Interior-point methods (Q1593831) (← links)
• Point-to-point iterative learning model predictive control (Q1640249) (← links)
• A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming (Q1769066) (← links)
• An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
• Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
• An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
• Potential reduction method for harmonically convex programming (Q1893464) (← links)
• The use of lower bounds in minimization by the interior-point method (Q1903920) (← links)
• Nonlinear coordinate representations of smooth optimization problems (Q1905043) (← links)
• A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• Complexity analysis for certain convex programming problems (Q1974569) (← links)
• Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• A feasible BFGS interior point algorithm for solving convex minimization problems (Q2706324) (← links)
• Some results of convex programming complexity (Q2858594) (← links)
• A Self-Concordant Interior Point Approach for Optimal Control with State Constraints (Q2954395) (← links)
• Function space interior point methods for PDE constrained optimization (Q2954569) (← links)
• Sparsity in convex quadratic programming with interior point methods (Q3423592) (← links)
• A generalized interior-point barrier function approach for smooth convex programming with linear constraints (Q4264497) (← links)
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
• Interior dual proximal point algorithm using preconditioned conjugate gradient † (Q4327905) (← links)
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming (Q4339371) (← links)
• (Q4347847) (← links)
• (Q4347851) (← links)
• (Q4347852) (← links)
• (Q4358711) (← links)
• On self-concordant convex–concave functions (Q4504785) (← links)
• (Q4799867) (← links)
• Monotonicity of the Lagrangian function in the parametric interior point methods of convex programming (Q4838444) (← links)
• (Q4883369) (← links)