Primal-dual interior-point algorithms for convex quadratic circular cone optimization

DOI10.3934/NACO.2015.5.211MaRDI QIDQ2353476zbMATH OpenOpenAlexFDO

Authors Guoqiang Wang, Xue-Rui Gao, Yanqin Bai

Publication date 14 July 2015

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2015.5.211

zbMATH Keywords

circular cone optimizationinterior-point methodskernel functionlarge- and small-update methodspolynomial complexitysecond-order cone optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Primal-dual path-following algorithms for circular programming
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A self-concordant interior point algorithm for nonsymmetric circular cone programming
• A new full-NT step interior-point method for circular cone optimization

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Circular cone convexity and some inequalities associated with circular cones
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Handbook on semidefinite, conic and polynomial optimization
• scientific article; zbMATH DE number 5798339 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 6325420 (Why is no real title available?)
• On cone of nonsymmetric positive semidefinite matrices
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Second-order cone programming
• Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
• The vector-valued functions associated with circular cones
• Towards non-symmetric conic optimization
• Variational analysis of circular cone programs

Cited in

(17)

• A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
• Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
• Grasping torque optimization for a dexterous robotic hand using the linearization of constraints
• Variational inequality formulation of circular cone eigenvalue complementarity problems
• A nonmonotone smoothing Newton method for circular cone programming
• A self-concordant interior point algorithm for nonsymmetric circular cone programming
• A circular cone relaxation primal interior point algorithm for LP
• Primal-dual path-following algorithms for circular programming
• Elliptic cone optimization and primal-dual path-following algorithms
• Improved convergence analysis of a smoothing Newton method for the circular cone programming
• No gap second-order optimality conditions for circular conic programs
• Augmented Lagrangian method for nonlinear circular conic programs: a local convergence analysis
• Expected value method for a class of stochastic linear circular cone complementarity problems
• A polynomial-time interior-point method for circular cone programming based on kernel functions
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization

This page was built for publication: Primal-dual interior-point algorithms for convex quadratic circular cone optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353476)