A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
From MaRDI portal
(Redirected from Publication:993313)
Recommendations
- A non-smoothing Newton method for nonlinear second-order cone programming
- A new non-interior continuation method for second-order cone programming
- A new non-interior continuation method for second-order cone programming
- A non-interior-point continuous algorithm with superlinear convergence for second-order cone programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A globally convergent interior point algorithm for non-convex nonlinear programming
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A non-interior continuation method for second-order cone programming
- A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A new inexact alternating directions method for monotone variational inequalities
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Analysis of a smoothing method for symmetric conic linear programming
- Applications of second-order cone programming
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Further Development of a Primal-Dual Interior Point Method
- Interior point methods for second-order cone programming and OR applications
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On Polyhedral Approximations of the Second-Order Cone
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Projection and contraction methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Second-order cone programming
- Semidefinite optimization
- Smoothing functions for second-order-cone complementarity problems
- Solving a class of asymmetric variational inequalities by a new alternating direction method
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
Cited in
(3)- A new non-interior point algorithm for circular cone programming
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
This page was built for publication: A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993313)
