2020
DOI: 10.1016/j.optlaseng.2020.106082
|View full text |Cite
|
Sign up to set email alerts
|

Fast compressed sensing analysis for imaging reconstruction with primal dual interior point algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 27 publications
0
5
0
Order By: Relevance
“…According to the prime dual method, the solution can be achieved by narrowing the dual gap between the feasible solution of the prime and dual problem. It starts from an arbitrary chosen initial point and searching and going to the direction to find the optimal solution by applying the classical Newton method [39]. Implementation of this approach is computationally possible as free software packages are already available to solve the problem iteratively.…”
Section: Prime-dual Interior-point Methodsmentioning
confidence: 99%
“…According to the prime dual method, the solution can be achieved by narrowing the dual gap between the feasible solution of the prime and dual problem. It starts from an arbitrary chosen initial point and searching and going to the direction to find the optimal solution by applying the classical Newton method [39]. Implementation of this approach is computationally possible as free software packages are already available to solve the problem iteratively.…”
Section: Prime-dual Interior-point Methodsmentioning
confidence: 99%
“…( 9) According to the prime dual method, the solution can be achieved by narrowing the dual gap between the feasible solution of the prime and dual problem. It starts from an arbitrary chosen initial point and searching direction then it going to find the optimal solution by applying the classical Newton method [37]. Implementation of this approach computationally possible as a free software package available to solve the problem iteratively.…”
Section: Prime-dual Interior-point Methodsmentioning
confidence: 99%
“…In essence, it is an algorithm that combines logarithmic barrier function, Lagrange function method, and Newton iteration method for optimization calculation by introducing relaxation variable and Lagrange multiplier vector and has the advantages of these three methods at the same time. The primal dual 5 Wireless Communications and Mobile Computing interior point method starts from the feasible initial interior point and searches for optimization within the feasible region along the steepest descent direction of the primal dual path until it approaches the optimal solution [26]. When solving large-scale linear programming problems, it has been proved theoretically that it has polynomial time complexity and second-order convergence characteristics.…”
Section: Design Of the Trust Region Interior Point Algorithm For Nonl...mentioning
confidence: 99%