Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[BOK][B] Variational analysis and applications
BS Mordukhovich - 2018 - Springer
Boris S. Mordukhovich Page 1 Springer Monographs in Mathematics Boris S. Mordukhovich
Variational Analysis and Applications Page 2 Springer Monographs in Mathematics Editors-in-Chief …
Variational Analysis and Applications Page 2 Springer Monographs in Mathematics Editors-in-Chief …
Cardinality minimization, constraints, and regularization: a survey
We survey optimization problems that involve the cardinality of variable vectors in
constraints or the objective function. We provide a unified viewpoint on the general problem …
constraints or the objective function. We provide a unified viewpoint on the general problem …
An augmented Lagrangian method for optimization problems with structured geometric constraints
This paper is devoted to the theoretical and numerical investigation of an augmented
Lagrangian method for the solution of optimization problems with geometric constraints …
Lagrangian method for the solution of optimization problems with geometric constraints …
Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean
spaces. Of special interest are the method of alternating projections (AP) and the Douglas …
spaces. Of special interest are the method of alternating projections (AP) and the Douglas …
Alternating projections and Douglas-Rachford for sparse affine feasibility
The problem of finding a vector with the fewest nonzero elements that satisfies an
underdetermined system of linear equations is an NP-complete problem that is typically …
underdetermined system of linear equations is an NP-complete problem that is typically …
Quantitative convergence analysis of iterated expansive, set-valued map**s
D Russell Luke, NH Thao… - Mathematics of Operations …, 2018 - pubsonline.informs.org
We develop a framework for quantitative convergence analysis of Picard iterations of
expansive set-valued fixed point map**s. There are two key components of the analysis …
expansive set-valued fixed point map**s. There are two key components of the analysis …
Greedy projected gradient-Newton method for sparse logistic regression
R Wang, N **u, C Zhang - IEEE transactions on neural …, 2019 - ieeexplore.ieee.org
Sparse logistic regression (SLR), which is widely used for classification and feature
selection in many fields, such as neural networks, deep learning, and bioinformatics, is the …
selection in many fields, such as neural networks, deep learning, and bioinformatics, is the …
Restricted normal cones and the method of alternating projections: theory
In this paper, we introduce and develop the theory of restricted normal cones which
generalize the classical Mordukhovich normal cone. We thoroughly study these objects from …
generalize the classical Mordukhovich normal cone. We thoroughly study these objects from …
Recent results on Douglas–Rachford methods for combinatorial optimization problems
Recent Results on Douglas–Rachford Methods for Combinatorial Optimization Problems |
Journal of Optimization Theory and Applications Skip to main content SpringerLink Account …
Journal of Optimization Theory and Applications Skip to main content SpringerLink Account …
Solution sets of three sparse optimization problems for multivariate regression
X Chen, L Pan, N **u - Journal of Global Optimization, 2023 - Springer
In multivariate regression analysis, a coefficient matrix is used to relate multiple response
variables to regressor variables in a noisy linear system from given data. Optimization is a …
variables to regressor variables in a noisy linear system from given data. Optimization is a …