Pages that link to "Item:Q4320797"

The following pages link to The convergence of a modified barrier method for convex programming (Q4320797):

Displaying 18 items.

• Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions (Q393377) (← links)
• One modification of the logarithmic barrier function method in linear and convex programming (Q735653) (← links)
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
• A modification of the barrier-function method (Q1086165) (← links)
• Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
• Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
• Two properties of condition numbers for convex programs via implicitly defined barrier functions (Q1849258) (← links)
• An adaptive barrier method for convex programming (Q1902359) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• Support vector machine via nonlinear rescaling method (Q2468778) (← links)
• Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization (Q2696952) (← links)
• The Legendre Transformation in Modern Optimization (Q2957720) (← links)
• On the convergence of some sequential algorithms with multiplicative barrier function for convex optimization (Q3976780) (← links)
• Monotonicity of the Lagrangian function in the parametric interior point methods of convex programming (Q4838444) (← links)
• A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
• (Q5389780) (← links)
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)
• Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)