A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
From MaRDI portal
Publication:2817226
DOI10.1080/02331934.2016.1147034zbMath1397.90399OpenAlexW2331132201MaRDI QIDQ2817226
No author found.
Publication date: 29 August 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1147034
Related Items (7)
A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control ⋮ An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term ⋮ A generic kernel function for interior point methods ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
Cites Work
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Two new predictor-corrector algorithms for second-order cone programming
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- An infeasible-interior-point predictor-corrector algorithm for the second-order cone program
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- Robust Convex Optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
