Composite Difference-Max Programs for Modern Statistical Estimation Problems (Q4562249)

scientific article; zbMATH DE number 6995707

Language	Label	Description	Also known as
English	Composite Difference-Max Programs for Modern Statistical Estimation Problems	scientific article; zbMATH DE number 6995707

Statements

instance of

scholarly article

0 references

title

Composite Difference-Max Programs for Modern Statistical Estimation Problems (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

19 December 2018

0 references

full work available at URL

https://arxiv.org/abs/1803.00205

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

continuous piecewise affine regression

0 references

nonconvex optimization

0 references

nondifferentiable objective

0 references

semismooth Newton method

0 references

describes a project that uses

SDPNAL+

0 references

MaRDI profile type

MaRDI publication profile

0 references

arXiv ID

1803.00205

0 references

cites work

Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

An algorithm for the estimation of a regression function by continuous piecewise linear functions

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Q2825953

0 references

Q4188569

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Q3995193

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

Q3996569

0 references

Support-vector networks

0 references

Q4139463

0 references

Structural properties of affine sparsity constraints

0 references

Q2933946

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

On functions representable as a difference of convex functions

0 references

Q5251797

0 references

Regression Quantiles

0 references

EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS

0 references

Q3813205

0 references

MM Optimization Algorithms

0 references

Convergence analysis of difference-of-convex algorithm with subanalytic data

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

DC approximation approaches for sparse optimization

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

0 references

Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning

0 references

A Computational Framework for Multivariate Convex Regression and Its Variants

0 references

Semismooth and Semiconvex Functions in Constrained Optimization

0 references

A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization

0 references

Iterative Solution of Nonlinear Equations in Several Variables

0 references

Newton's Method for B-Differentiable Equations

0 references

A globally convergent Newton method for convex $SC^ 1$ minimization problems

0 references

Computing B-Stationary Points of Nonsmooth DC Programs

0 references

A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix

0 references

A nonsmooth version of Newton's method

0 references

Variational Analysis

0 references

On the structure of convex piecewise quadratic functions

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

A proximal difference-of-convex algorithm with extrapolation

0 references

On the convergence properties of the EM algorithm

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

Minimization of $\ell_{1-2}$ for Compressed Sensing

0 references

Automatic speech recognition. A deep learning approach

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Robust multicategory support vector machines using difference convex algorithm

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4562249