Pages that link to "Item:Q4785904"
From MaRDI portal
The following pages link to Active Sets, Nonsmoothness, and Sensitivity (Q4785904):
Displaying 50 items.
- A proximal method for composite minimization (Q304260) (← links)
- Composite proximal bundle method (Q359623) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- Optimality, identifiability, and sensitivity (Q463741) (← links)
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
- New active set identification for general constrained optimization and minimax problems (Q743206) (← links)
- A proximal method for identifying active manifolds (Q839490) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
- Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function (Q2190753) (← links)
- Convergence rates of forward-Douglas-Rachford splitting method (Q2317846) (← links)
- Nonsmoothness and a variable metric method (Q2346393) (← links)
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
- Local linear convergence of a primal-dual algorithm for the augmented convex models (Q2399239) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- The degrees of freedom of partly smooth regularizers (Q2409395) (← links)
- On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition (Q2414903) (← links)
- Functions and sets of smooth substructure: relationships and examples (Q2506176) (← links)
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods (Q2576738) (← links)
- A Sard theorem for tame set-valued mappings (Q2642156) (← links)
- Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
- Generic Minimizing Behavior in Semialgebraic Optimization (Q2789611) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
- First- and second-order optimality conditions for piecewise smooth objective functions (Q2829568) (← links)
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods (Q2968179) (← links)
- Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness (Q3300345) (← links)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems (Q3426228) (← links)
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit (Q3450036) (← links)
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems (Q3522308) (← links)
- Sensitivity Analysis for Mirror-Stratifiable Convex Functions (Q4554065) (← links)
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
- Model selection with low complexity priors (Q4603697) (← links)
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions (Q4657702) (← links)
- A Decomposition Algorithm for the Sums of the Largest Eigenvalues (Q4985169) (← links)
- Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
- Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
- Partial Smoothness and Constant Rank (Q5067431) (← links)
- The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Relaxed Gauss--Newton Methods with Applications to Electrical Impedance Tomography (Q5143302) (← links)
- Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks (Q5146608) (← links)
- Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization (Q5231673) (← links)