Identifiable Surfaces in Constrained Optimization
From MaRDI portal
Publication:3138083
DOI10.1137/0331048zbMATH Open0804.90105OpenAlexW1969594194MaRDI QIDQ3138083FDOQ3138083
Publication date: 6 December 1993
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0331048
Recommendations
- scientific article; zbMATH DE number 2155014
- Exposing Constraints
- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
- On the Identification of Active Constraints
- On the Identification Property of a Projected Gradient Method
Convex programming (90C25) Nonlinear programming (90C30) Implicit function theorems, Jacobians, transformations with several variables (26B10) Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07)
Cited In (42)
- Distributed Learning with Sparse Communications by Identification
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- A proximal method for composite minimization
- Proximal Gradient Methods with Adaptive Subspace Sampling
- A proximal method for identifying active manifolds
- An approximate decomposition algorithm for convex minimization
- The degrees of freedom of partly smooth regularizers
- Error bounds in mathematical programming
- Newton acceleration on manifolds identified by proximal gradient methods
- Stochastic algorithms with geometric step decay converge linearly on sharp functions
- Active‐Set Newton Methods and Partial Smoothness
- Proximal methods avoid active strict saddles of weakly convex functions
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
- Model selection with low complexity priors
- Generic minimizing behavior in semialgebraic optimization
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Local linear convergence of proximal coordinate descent algorithm
- Exposing Constraints
- Asymptotic normality and optimality in nonsmooth stochastic approximation
- Optimality, identifiability, and sensitivity
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- New active set identification for general constrained optimization and minimax problems
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- Low Complexity Regularization of Linear Inverse Problems
- Functions and sets of smooth substructure: relationships and examples
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Derivative-free optimization methods for finite minimax problems
- Partial Smoothness and Constant Rank
- Asymptotic optimality in stochastic optimization
- On the Identification of Active Constraints
- On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition
- Local linear convergence analysis of Primal–Dual splitting methods
This page was built for publication: Identifiable Surfaces in Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138083)
