Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
From MaRDI portal
Recommendations
- On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- A self-concordant exponential kernel function based interior point algorithm for second-order cone optimization
- On self-regular IPMs (with comments and rejoinder)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
Cited in
(41)- Large-update interior point algorithm for P_*-linear complementarity problem
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A dynamic large-update primal‐dual interior-point method for linear optimization
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- A primal–dual interior point method for nonlinear optimization over second-order cones
- A new non-interior continuation method for solving the second-order cone complementarity problem
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new smoothing Newton-type method for second-order cone programming problems
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- An adaptive self-regular proximity-based large-update IPM for LO
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- Interior proximal methods and central paths for convex second-order cone programming
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Self-regular functions and new search directions for linear and semidefinite optimization
- On self-regular IPMs (with comments and rejoinder)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- A note on treating a second order cone program as a special case of a semidefinite program
- On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- On the generalized fischer-burmeister merit function for the second-order cone complementarity problem
- Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A corrector-predictor path-following method for second-order cone optimization
- Notes on Duality in Second Order and p -Order Cone Optimization
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- A power penalty method for second-order cone nonlinear complementarity problems
- A new one-step smoothing Newton method for second-order cone programming.
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
This page was built for publication: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785875)
