Mathematical Programming for the Sum of Two Convex Functions With Applications to Lasso Problem, Split Feasibility Problems, and Image Deblurring Problem

Fixed Point Theory and Applications - United Kingdom
doi 10.1186/s13663-015-0388-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Two-Phase Mathematical Programming Approach for Rolling Stock Circulation Problem

Transactions of the Operations Research Society of Japan
2010English

Strong Convergence Theorems for a Nonexpansive Mapping and Its Applications for Solving the Split Feasibility Problem

Journal of Nonlinear Science and Applications
Number TheoryAnalysisAlgebra
2017English

Optimality Conditions for a Cone-Convex Programming Problem

Journal of the Australian Mathematical Society
Mathematics
1979English

Preconditioning Methods for Solving a General Split Feasibility Problem

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2014English

On a Problem Connected With Strongly Convex Functions

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2016English

Strong Convergence for Generalized Multiple-Set Split Feasibility Problem

Filomat
Mathematics
2016English

A General Extremal Problem for the Class of Close-To-Convex Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1977English

Inner Approximation Method for a Reverse Convex Programming Problem

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2000English

Fuzzy Mathematical Programming Approach for Solving Fuzzy Linear Fractional Programming Problem

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy