scientific article; zbMATH DE number 2155014

Publication date: 11 April 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

nonlinear program, nonsmooth optimization, variational analysis, partly smooth, prox-regular, identifiable surface, projected gradient

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

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, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Local convergence properties of Douglas-Rachford and alternating direction method of multipliers, Local linear convergence of a primal-dual algorithm for the augmented convex models, Asymptotic optimality in stochastic optimization, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, Harnessing Structure in Composite Nonsmooth Minimization, Thresholding gradient methods in Hilbert spaces: support identification and linear convergence, Linearly convergent bilevel optimization with single-step inner methods, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification, Local linear convergence of proximal coordinate descent algorithm, Model selection with low complexity priors, A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization, Activity Identification and Local Linear Convergence of Forward--Backward-type Methods, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness, Derivative-free optimization via proximal point methods, Computing proximal points of nonconvex functions, Local linear convergence analysis of Primal–Dual splitting methods, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, On the interplay between acceleration and identification for the proximal gradient algorithm, Generic Minimizing Behavior in Semialgebraic Optimization, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, Functions and sets of smooth substructure: relationships and examples, Low Complexity Regularization of Linear Inverse Problems, Distributed Learning with Sparse Communications by Identification, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, New active set identification for general constrained optimization and minimax problems, Faster subgradient methods for functions with Hölderian growth, Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method, ``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, Convergence rates of forward-Douglas-Rachford splitting method, Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, Proximal Gradient Methods with Adaptive Subspace Sampling