A proximal method for composite minimization (Q304260)

From MaRDI portal

Revision as of 10:58, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A proximal method for composite minimization	scientific article

Statements

scholarly article

0 references

A proximal method for composite minimization (English)

0 references

Adrian S. Lewis

0 references

Stephen J. Wright

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

25 August 2016

0 references

full work available at URL

https://arxiv.org/abs/0812.0423

0 references

zbMATH Keywords

prox-regular functions

0 references

polyhedral convex functions

0 references

sparse optimization

0 references

global convergence

0 references

active constraint identification

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Generic Optimality Conditions for Semialgebraic Convex Programs

0 references

0 references

Descent methods for composite nondifferentiable optimization problems

0 references

On the Identification of Active Constraints II: The Nonconvex Case

0 references

On the Identification of Active Constraints

0 references

On the Convergence of Successive Linear-Quadratic Programming Algorithms

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Exact matrix completion via convex optimization

0 references

0 references

Atomic Decomposition by Basis Pursuit

0 references

Proximal Methods for Cohypomonotone Operators

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems

0 references

Metric regularity and systems of generalized equations

0 references

The radius of metric regularity

0 references

Least angle regression. (With discussion)

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Nonlinear programming and nonsmooth optimization by successive linear programming

0 references

On the superlinear convergence of a trust region algorithm for nonsmooth optimization

0 references

A generalized proximal point algorithm for certain non-convex minimization problems

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

0 references

Inexact Variants of the Proximal Point Algorithm without Monotonicity

0 references

Exact and Approximate Sparse Solutions of Underdetermined Linear Equations

0 references

Proximal point methods and nonconvex optimization

0 references

0 references

Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization

0 references

The 𝒰-Lagrangian of a convex function

0 references

Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping Theorem

0 references

Active Sets, Nonsmoothness, and Sensitivity

0 references

Minimum-support solutions of polyhedral concave programs<sup>*</sup>

0 references

A \(\mathcal{VU}\)-algorithm for convex minimization

0 references

Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods

0 references

Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Convex Analysis

0 references

Variational Analysis

0 references

Nonlinear total variation based noise removal algorithms

0 references

Composite proximal bundle method

0 references

0 references

On a Class of Nonsmooth Composite Functions

0 references

LASSO-pattern search algorithm with application to ophthalmology and genomic data

0 references

Submonotone mappings and the proximal point algorithm

0 references

0 references

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation

0 references

Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization

0 references

Identifiable Surfaces in Constrained Optimization

0 references

Sparse Reconstruction by Separable Approximation

0 references

Conditions for convergence of trust region algorithms for nonsmooth optimization

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-015-0943-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:304260

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q304260&oldid=36268726"