Primal-dual interior-point algorithms for convex quadratic circular cone optimization
From MaRDI portal
Publication:2353476
DOI10.3934/naco.2015.5.211zbMath1317.90193OpenAlexW2525685476MaRDI QIDQ2353476
Yan-Qin Bai, Xue-Rui Gao, Guo-Qiang Wang
Publication date: 14 July 2015
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2015.5.211
kernel functioninterior-point methodspolynomial complexitylarge- and small-update methodssecond-order cone optimizationcircular cone optimization
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Related Items (8)
Variational inequality formulation of circular cone eigenvalue complementarity problems ⋮ Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. ⋮ Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones ⋮ Improved convergence analysis of a smoothing Newton method for the circular cone programming ⋮ A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots ⋮ No Gap Second-Order Optimality Conditions for Circular Conic Programs ⋮ Grasping torque optimization for a dexterous robotic hand using the linearization of constraints ⋮ A nonmonotone smoothing Newton method for circular cone programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Handbook on semidefinite, conic and polynomial optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- On cone of nonsymmetric positive semidefinite matrices
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- The vector-valued functions associated with circular cones
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Circular cone convexity and some inequalities associated with circular cones
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Variational analysis of circular cone programs
- Towards non-symmetric conic optimization
This page was built for publication: Primal-dual interior-point algorithms for convex quadratic circular cone optimization
