Composite optimization with indicator functions: stationary duality and a semismooth Newton method
From MaRDI portal
Cites work
- A fast dual proximal gradient algorithm for convex minimization and applications
- A Generalized Newton Method for Subgradient Systems
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A NEW MEASURE OF RANK CORRELATION
- A nonsmooth version of Newton's method
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- A QP-free constrained Newton-type method for variational inequality problems
- An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Analysis of a class of minimization problems lacking lower semicontinuity
- Clarke Subgradients of Stratifiable Functions
- Complementarity formulations of \(\ell_0\)-norm optimization
- Convergence of descent optimization algorithms under Polyak-Łojasiewicz-Kurdyka conditions
- Convex Analysis
- Derivative-free optimization methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Fuzzy sets
- Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Group sparse recovery via group square-root elastic net and the iterative multivariate thresholding-based algorithm
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 176973 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Maximum relative margin and data-dependent regularization
- Modern nonconvex nondifferentiable optimization
- Non-parametric analysis of a generalized regression model. The maximum rank correlation estimator
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- On a Semismooth* Newton Method for Solving Generalized Equations
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Regularization and Variable Selection Via the Elastic Net
- Second-order variational analysis in optimization, variational stability, and control. Theory, algorithms, applications
- Support-vector networks
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Tilt Stability of a Local Minimum
- Variational Analysis
- Variational analysis and applications
This page was built for publication: Composite optimization with indicator functions: stationary duality and a semismooth Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349073)
