First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104): Difference between revisions

Latest revision as of 09:44, 30 July 2024

scientific article; zbMATH DE number 7105234

Language	Label	Description	Also known as
English	First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants	scientific article; zbMATH DE number 7105234

Statements

instance of

scholarly article

0 references

title

First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (English)

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

16 September 2019

0 references

zbMATH Keywords

surface identification

0 references

manifold identification

0 references

active set

0 references

finite convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the Goldstein-Levitin-Polyak gradient projection method

0 references

Projected Newton Methods for Optimization Problems with Simple Constraints

0 references

Q3151174

0 references

Large-scale active-set box-constrained optimization method with spectral projected gradients

0 references

On the Identification of Active Constraints II: The Nonconvex Case

0 references

On the Identification of Active Constraints

0 references

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

0 references

A two-stage active-set algorithm for bound-constrained optimization

0 references

An active-set algorithmic framework for non-convex optimization problems over the simplex

0 references

The complexity of optimizing over a simplex, hypercube or sphere: a short survey

0 references

An active set feasible method for large-scale minimization problems with bound constraints

0 references

Some comments on Wolfe's ‘away step’

0 references

A New Active Set Algorithm for Box Constrained Optimization

0 references

Q4665560

0 references

First-order methods almost always avoid strict saddle points

0 references

Q5405171

0 references

Q4795311

0 references

Finding the Point of a Polyhedron Closest to the Origin

0 references

``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern?

0 references

Q4103334

0 references

Identifiable Surfaces in Constrained Optimization

0 references

Accelerated Block-coordinate Relaxation for Regularized Optimization

0 references

full work available at URL

https://doi.org/10.1137/18m1206953

0 references

Identifiers

zbMATH Open document ID

1461.65132

0 references

DOI

10.1137/18M1206953

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5233104

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the Goldstein-Levitin-Polyak gradient projection method
+Normal rank
@@ Property / cites work @@
+Projected Newton Methods for Optimization Problems with Simple Constraints
+Normal rank
@@ Property / cites work @@
+Q3151174
@@ Property / cites work: Q3151174 / rank @@
+Normal rank
@@ Property / cites work @@
+Large-scale active-set box-constrained optimization method with spectral projected gradients
+Normal rank
@@ Property / cites work @@
+On the Identification of Active Constraints II: The Nonconvex Case
+Normal rank
@@ Property / cites work @@
+On the Identification of Active Constraints
@@ Property / cites work: On the Identification of Active Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
+Normal rank
@@ Property / cites work @@
+A two-stage active-set algorithm for bound-constrained optimization
+Normal rank
@@ Property / cites work @@
+An active-set algorithmic framework for non-convex optimization problems over the simplex
+Normal rank
@@ Property / cites work @@
+The complexity of optimizing over a simplex, hypercube or sphere: a short survey
+Normal rank
@@ Property / cites work @@
+An active set feasible method for large-scale minimization problems with bound constraints
+Normal rank
@@ Property / cites work @@
+Some comments on Wolfe's ‘away step’
@@ Property / cites work: Some comments on Wolfe's ‘away step’ / rank @@
+Normal rank
@@ Property / cites work @@
+A New Active Set Algorithm for Box Constrained Optimization
+Normal rank
@@ Property / cites work @@
+Q4665560
@@ Property / cites work: Q4665560 / rank @@
+Normal rank
@@ Property / cites work @@
+First-order methods almost always avoid strict saddle points
+Normal rank
@@ Property / cites work @@
+Q5405171
@@ Property / cites work: Q5405171 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4795311
@@ Property / cites work: Q4795311 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Point of a Polyhedron Closest to the Origin
+Normal rank
@@ Property / cites work @@
+``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern?
+Normal rank
@@ Property / cites work @@
+Q4103334
@@ Property / cites work: Q4103334 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifiable Surfaces in Constrained Optimization
@@ Property / cites work: Identifiable Surfaces in Constrained Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated Block-coordinate Relaxation for Regularized Optimization
+Normal rank
@@ Property / Wikidata QID @@
+Q127290317
@@ Property / Wikidata QID: Q127290317 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/18m1206953
+Normal rank
@@ Property / OpenAlex ID @@
+W2972033766
@@ Property / OpenAlex ID: W2972033766 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5233104