Identifiable Surfaces in Constrained Optimization
From MaRDI portal
Publication:3138083
DOI10.1137/0331048zbMath0804.90105OpenAlexW1969594194MaRDI QIDQ3138083
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
Convex programming (90C25) Nonlinear programming (90C30) Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07) Implicit function theorems, Jacobians, transformations with several variables (26B10)
Related Items
A Trust-region Method for Nonsmooth Nonconvex Optimization, Nonsmoothness in machine learning: specific structure, proximal identification, and applications, A proximal method for identifying active manifolds, A proximal method for composite minimization, Proximal methods avoid active strict saddles of weakly convex functions, Partial Smoothness and Constant Rank, Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization, Error bounds in mathematical programming, Local convergence properties of Douglas-Rachford and alternating direction method of multipliers, Asymptotic optimality in stochastic optimization, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, The degrees of freedom of partly smooth regularizers, On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition, Newton acceleration on manifolds identified by proximal gradient methods, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Local linear convergence of proximal coordinate descent algorithm, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, Model selection with low complexity priors, Linear convergence analysis of the use of gradient projection methods on total variation problems, Activity Identification and Local Linear Convergence of Forward--Backward-type Methods, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Optimality, identifiability, and sensitivity, 𝒱𝒰-smoothness and proximal point results for some nonconvex functions, An approximate decomposition algorithm for convex minimization, Derivative-free optimization methods for finite minimax problems, Local linear convergence analysis of Primal–Dual splitting methods, Generic Minimizing Behavior in Semialgebraic Optimization, Functions and sets of smooth substructure: relationships and examples, Low Complexity Regularization of Linear Inverse Problems, An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization, Distributed Learning with Sparse Communications by Identification, New active set identification for general constrained optimization and minimax problems, ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Active‐Set Newton Methods and Partial Smoothness, Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems, Proximal Gradient Methods with Adaptive Subspace Sampling
