Proximal Distance Algorithms: Theory and Examples
From MaRDI portal
Publication:5381120
zbMath1489.90184arXiv1604.05694MaRDI QIDQ5381120
Hua Zhou, Kevin L. Keys, Kenneth L. Lange
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1604.05694
Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items
Dimension Reduction for Integrative Survival Analysis, A Legacy of EM Algorithms, Algorithms for Sparse Support Vector Machines, Unnamed Item, Finding best approximation pairs for two intersections of closed convex sets, A penalized method of alternating projections for weighted low-rank Hankel matrix optimization, High-performance statistical computing in the computing environments of the 2020s, Random minibatch subgradient algorithms for convex problems with functional constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- Sparse inverse covariance estimation with the graphical lasso
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Optimal detection of sparse principal components in high dimension
- Distance majorization and its applications
- Majorization as a tool for optimizing a class of matrix functions
- Convex analysis and nonlinear optimization. Theory and examples.
- Sparse principal component analysis via regularized low rank matrix approximation
- Linear and nonlinear programming.
- SPADES and mixture models
- Semianalytic and subanalytic sets
- Applications of second-order cone programming
- Minimization of a class of matrix trace functions by means of refined majorization
- Second-order cone programming
- On Fréchet subdifferentials
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An algorithmic approach to nonlinear analysis and optimization
- MM Optimization Algorithms
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Generalized power method for sparse principal component analysis
- Proximal Splitting Methods in Signal Processing
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Variational Approach to Copositive Matrices
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Matrix completion via an alternating direction method
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Computing in Operations Research Using Julia
- Constructing copositive matrices from interior matrices
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- A Numerically Stable Solver for Positive Semidefinite Quadratic Programs Based on Nonnegative Least Squares
- The proximal distance algorithm
- Closest point search in lattices
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Discussion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The convergence rate of the penalty function method
- JuMP: A Modeling Language for Mathematical Optimization
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Mean Value Methods in Iteration
- Variational methods for the solution of problems of equilibrium and vibrations
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex functions and their applications. A contemporary approach
