An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879): Difference between revisions

Latest revision as of 08:11, 24 July 2024

scientific article

Language	Label	Description	Also known as
English	An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

author

Yanyan Li

0 references

published in

Optimization and Engineering

0 references

publication date

18 January 2021

0 references

zbMATH Keywords

kernel function

0 references

linearly constrained convex optimization

0 references

interior point methods

0 references

large-update methods

0 references

complexity bounds

0 references

non-negative matrix factorization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11081-020-09514-x

0 references

cites work

Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO

0 references

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Algorithms and applications for approximate nonnegative matrix factorization

0 references

An efficient twice parameterized trigonometric kernel function for linear optimization

0 references

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term

0 references

An efficient parameterized logarithmic kernel function for linear optimization

0 references

SVD based initialization: A head start for nonnegative matrix factorization

0 references

Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term

0 references

Q2997579

0 references

Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

0 references

An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function

0 references

A generic kernel function for interior point methods

0 references

An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function

0 references

A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function

0 references

Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term

0 references

A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions

0 references

Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term

0 references

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term

0 references

Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

0 references

Interior-point algorithm for linear optimization based on a new trigonometric kernel function

0 references

An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term

0 references

Projected Gradient Methods for Nonnegative Matrix Factorization

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

Q4791754

0 references

Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function

0 references

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

0 references

Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

0 references

A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions

0 references

Q2932930

0 references

A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization

0 references

Identifiers

zbMATH Open document ID

1457.90108

0 references

DOI

10.1007/s11081-020-09514-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2218879

@@ Property / cites work @@
+Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
+Normal rank
@@ Property / cites work @@
+A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+Algorithms and applications for approximate nonnegative matrix factorization
+Normal rank
@@ Property / cites work @@
+An efficient twice parameterized trigonometric kernel function for linear optimization
+Normal rank
@@ Property / cites work @@
+An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+An efficient parameterized logarithmic kernel function for linear optimization
+Normal rank
@@ Property / cites work @@
+SVD based initialization: A head start for nonnegative matrix factorization
+Normal rank
@@ Property / cites work @@
+Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Q2997579
@@ Property / cites work: Q2997579 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
+Normal rank
@@ Property / cites work @@
+A generic kernel function for interior point methods
+Normal rank
@@ Property / cites work @@
+An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
+Normal rank
@@ Property / cites work @@
+Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
+Normal rank
@@ Property / cites work @@
+A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
+Normal rank
@@ Property / cites work @@
+Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
+Normal rank
@@ Property / cites work @@
+An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Interior-point algorithm for linear optimization based on a new trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
+Normal rank
@@ Property / cites work @@
+Projected Gradient Methods for Nonnegative Matrix Factorization
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Q4791754
@@ Property / cites work: Q4791754 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
+Normal rank
@@ Property / cites work @@
+An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
+Normal rank
@@ Property / cites work @@
+Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
+Normal rank
@@ Property / cites work @@
+Q2932930
@@ Property / cites work: Q2932930 / rank @@
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
+Normal rank