A polynomial-time interior-point method for circular cone programming based on kernel functions
From MaRDI portal
Publication:747043
DOI10.3934/jimo.2016.12.739zbMath1327.90192OpenAlexW2554829751MaRDI QIDQ747043
Jing Zhang, Peng-Fei Ma, Yan-Qin Bai
Publication date: 22 October 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.739
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)
Related Items
An infeasible full NT-step interior point method for circular optimization, 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, A path following interior-point method for linear complementarity problems 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, A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
Cites Work
- Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
- Copositive optimization -- recent developments and applications
- A new exact penalty function method for continuous inequality constrained optimization problems
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Second-order cone programming
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- On a refinement of the convergence analysis for the new exact penalty function method for continuous inequality constrained optimization problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Barrier Functions in Interior Point Methods
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Towards non-symmetric conic optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
