Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions

From MaRDI portal
Publication:1012072

DOI10.1016/j.na.2008.07.016zbMath1190.90275OpenAlexW2082117585MaRDI QIDQ1012072

Guo-Qiang Wang, Cornelis Roos, Yan-Qin Bai

Publication date: 14 April 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2008.07.016



Related Items

A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Two wide neighborhood interior-point methods for symmetric cone optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, A smoothing Newton method for second-order cone optimization based on a new smoothing function, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, Two new predictor-corrector algorithms for second-order cone programming, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, A new one-step smoothing Newton method for second-order cone programming., Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, An interior-point algorithm for linear optimization based on a new barrier function, A one-parametric class of smoothing functions for second-order cone programming, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A polynomial-time interior-point method for circular cone programming based on kernel functions, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Primal-dual interior-point algorithms for convex quadratic circular cone optimization


Uses Software


Cites Work