Proceedings of the 2015 International Conference on Electrical, Automation and Mechanical Engineering 2015
DOI: 10.2991/eame-15.2015.178
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Infeasible Kernel-Based Interior-Point Methods for Linearly Constrained Convex Optimization

Abstract: In this paper, we present the implementation of infeasible kernel-based primal-dual interior-point methods for linearly constrained convex optimization. Numerical results are provided to demonstrate the efficiency of the algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?