An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization

DOI10.1007/S11081-020-09514-XMaRDI QIDQ2218879zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 January 2021

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11081-020-09514-x

zbMATH Keywords

complexity boundsinterior point methodskernel functionlarge-update methodslinearly constrained convex optimizationnon-negative matrix factorization

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
• An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A generic kernel function for interior point methods
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
• A predictor-corrector algorithm for linearly constrained convex optimization
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• A primal-infeasible interior point algorithm for linearly constrained convex programming
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Algorithms and applications for approximate nonnegative matrix factorization
• An efficient parameterized logarithmic kernel function for linear optimization
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• An efficient twice parameterized trigonometric kernel function for linear optimization
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• Interior path following primal-dual algorithms. I: Linear programming
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
• Projected Gradient Methods for Nonnegative Matrix Factorization
• SVD based initialization: A head start for nonnegative matrix factorization

Cited in

(2)

• Closing the iteration gap in linear programming with a new kernel function
• A novel kernel function bridging iteration bounds in interior-point algorithms for linear programming.

This page was built for publication: An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization

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