An efficient active-set method with applications to sparse approximations and risk minimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5703572 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- A Gauss-Newton method for convex composite optimization
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs
- A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- A primal-dual augmented Lagrangian
- Algorithm 866
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- An efficient duality-based approach for PDE-constrained sparse optimization
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- An interior point-proximal method of multipliers for convex quadratic programming
- Atomic decomposition by basis pursuit
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Coherent measures of risk
- Convergence and regularization results for optimal control problems with sparsity functional
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- General-purpose preconditioning for regularized interior point methods
- Generalizations of the proximal method of multipliers in convex optimization
- Global convergence of damped semismooth Newton methods for \(\ell_{1}\) Tikhonov regularization
- Globally Convergent Newton Methods for Nonsmooth Equations
- Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations
- IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
- Implicit Functions and Solution Mappings
- Inexact Newton methods for solving nonsmooth equations
- Interior‐point methods and preconditioning for PDE‐constrained optimization problems involving sparsity terms
- Lectures on Stochastic Programming
- Matrix-free interior point method for compressed sensing problems
- Mean-VaR portfolio optimization: a nonparametric approach
- Mixed-integer quadratic programming
- Monotone Operators and the Proximal Point Algorithm
- OSQP: an operator splitting solver for quadratic programs
- On a primal-dual Newton proximal method for convex quadratic programs
- On a semi-smooth Newton method and its globalization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Optimal dynamic portfolio selection: multiperiod mean-variance formulation
- Optimality conditions in portfolio analysis with general deviation measures
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
- Proximal Newton-type methods for minimizing composite functions
- Proximité et dualité dans un espace hilbertien
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- Regularization and Variable Selection Via the Elastic Net
- Solution of Sparse Indefinite Systems of Linear Equations
- Some continuity properties of polyhedral multifunctions
- Sparse approximations with interior point methods
- Support-vector networks
- Symmetric Quasidefinite Matrices
- The doubly regularized support vector machine
- Variational Analysis
This page was built for publication: An efficient active-set method with applications to sparse approximations and risk minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951378)
