Pages that link to "Item:Q1937023"
From MaRDI portal
The following pages link to A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023):
Displayed 50 items.
- Variational inequality formulation of circular cone eigenvalue complementarity problems (Q264216) (← links)
- A two-parametric class of merit functions for the second-order cone complementarity problem (Q364429) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- A generalized direction in interior point method for monotone linear complementarity problems (Q1733321) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596) (← links)
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
- A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
- The models of bilevel programming with lower level second-order cone programs (Q2405621) (← links)
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- A new corrector-predictor interior-point method for symmetric cone optimization (Q2678433) (← links)
- A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization (Q2795090) (← links)
- A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones (Q2805950) (← links)
- On the<i>P<sub>*</sub>(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones (Q2815503) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
- A Corrector-Predictor Interior-Point Algorithm for <i>P</i><sub>∗</sub>(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← links)
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i><sup>−1</sup>) iteration complexity (Q3174878) (← links)
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
- An infeasible interior-point method with improved centering steps for monotone linear complementarity problems (Q3452701) (← links)
- (Q4577944) (← links)
- New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization (Q4595149) (← links)
- (Q4604968) (← links)
- New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function (Q4622797) (← links)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
- A new full-NT step interior-point method for circular cone optimization (Q5147630) (← links)