Sun et al., 2018 - Google Patents
Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuitSun et al., 2018
- Document ID
- 6622693137696427823
- Author
- Sun M
- Sun H
- Wang Y
- Publication year
- Publication venue
- Journal of Applied Mathematics and Computing
External Links
Snippet
Recent years have witnessed the rapid development of the first order methods for multi- block separable programming involving large-scale date-set. The purpose of this paper is to introduce two new first order methods, the proximal splitting methods (PSMs), for the model …
- 229920000096 Plastarch material 0 abstract 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30389—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30587—Details of specialised database models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30289—Database design, administration or maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Cai et al. | On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function | |
Conn et al. | Use of quadratic models with mesh-adaptive direct search for constrained black box optimization | |
Ko et al. | Recent advances and outstanding challenges for machine learning interatomic potentials | |
Sun et al. | New hybrid conjugate gradient projection method for the convex constrained equations | |
Rosasco et al. | A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions | |
Liu et al. | A new adaptive Barzilai and Borwein method for unconstrained optimization | |
Delay | Smooth compactly supported solutions of some underdetermined elliptic PDE, with gluing applications | |
Zhang et al. | Scalable proximal Jacobian iteration method with global convergence analysis for nonconvex unconstrained composite optimizations | |
Boţ et al. | A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems | |
Liu et al. | A three-term derivative-free projection method for nonlinear monotone system of equations | |
Zhang et al. | An efficient spline collocation method for a nonlinear fourth-order reaction subdiffusion equation | |
Yu et al. | A new nonconvex approach to low-rank matrix completion with application to image inpainting | |
Sun et al. | Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit | |
Qu et al. | Analysis on Newton projection method for the split feasibility problem | |
Xu | A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming | |
Yang et al. | Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems | |
Sun et al. | Generalized Peaceman-Rachford splitting method for separable convex programming with applications to image processing | |
Griesse | Parametric sensitivity analysis in optimal control of a reaction-diffusion system–part II: practical methods and examples | |
Yu et al. | Generalized temporal similarity-based nonnegative tensor decomposition for modeling transition matrix of dynamic collaborative filtering | |
Liu et al. | A novel relaxed scalar auxiliary variable approach for gradient flows | |
Heiland et al. | Identification of linear time-invariant systems with dynamic mode decomposition | |
Berezansky et al. | Linearized oscillation theory for a nonlinear nonautonomous delay differential equation | |
Wang et al. | A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems | |
Sun et al. | Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing | |
Wang et al. | An efficient hardware implementation for complex square root calculation using a pwl method |