On the Identification of Active Constraints
From MaRDI portal
Publication:3813207
DOI10.1137/0725068zbMath0662.65052OpenAlexW2008063657MaRDI QIDQ3813207
Publication date: 1988
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0725068
Clarke subdifferentialstrict complementary conditionnondegeneracygradient projection methodsidentification of active constraintsquasi-polyhedral facessequential programming algorithms
Related Items (87)
Some recent advances in projection-type methods for variational inequalities ⋮ A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A limited memory quasi-Newton trust-region method for box constrained optimization ⋮ Some developments in general variational inequalities ⋮ New trends in general variational inequalities ⋮ A proximal method for identifying active manifolds ⋮ A proximal method for composite minimization ⋮ On the convergence of an active-set method for ℓ1minimization ⋮ A projected Newton method for minimization problems with nonlinear inequality constraints ⋮ Proximal methods avoid active strict saddles of weakly convex functions ⋮ An active set truncated Newton method for large-scale bound constrained optimization ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Partial Smoothness and Constant Rank ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ Error bounds in mathematical programming ⋮ Screening for a reweighted penalized conditional gradient method ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ On branching numbers of normal manifolds ⋮ Algorithms for bound constrained quadratic programming problems ⋮ New characterizations of weak sharp minima ⋮ Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense ⋮ On finite convergence of iterative methods for variational inequalities in Hilbert spaces ⋮ Newton acceleration on manifolds identified by proximal gradient methods ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ Projected gradient methods for linearly constrained problems ⋮ LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing ⋮ Local linear convergence of proximal coordinate descent algorithm ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ An active-set projected trust region algorithm for box constrained optimization problems ⋮ Gradient-based method with active set strategy for $\ell _1$ optimization ⋮ An active set limited memory BFGS algorithm for bound constrained optimization ⋮ Stopping rules and backward error analysis for bound-constrained optimization ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ Perturbing convex multiobjecttve programs ⋮ Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization ⋮ Convergence properties of trust region methods for linear and convex constraints ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ Optimality, identifiability, and sensitivity ⋮ An accurate active set conjugate gradient algorithm with project search for bound constrained optimization ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds ⋮ An active set limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems ⋮ Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions ⋮ On the accurate identification of active set for constrained minimax problems ⋮ Ergodic convergence in subgradient optimization ⋮ A new proof of Robinson's homeomorphism theorem for pl-normal maps ⋮ Derivative-free optimization methods for finite minimax problems ⋮ Modified fixed-point equations and related iterative methods for variational inequalities ⋮ Tangent projection equations and general variational inequalities ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ Hybrid approach with active set identification for mathematical programs with complementarity constraints ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Functions and sets of smooth substructure: relationships and examples ⋮ An algorithm for the fast solution of symmetric linear complementarity problems ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization ⋮ Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds ⋮ On finite convergence and constraint identification of subgradient projection methods ⋮ New active set identification for general constrained optimization and minimax problems ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ Conditional subgradient optimization -- theory and applications ⋮ ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern? ⋮ An inexact algorithm for composite nondifferentiable optimization ⋮ A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming ⋮ First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants ⋮ AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems ⋮ Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions ⋮ A non-monotonic method for large-scale non-negative least squares ⋮ An efficient implementation of a trust region method for box constrained optimization ⋮ Avoiding bad steps in Frank-Wolfe variants ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities ⋮ Proximal Gradient Methods with Adaptive Subspace Sampling ⋮ The least slope of a convex function and the maximal monotonicity of its subdifferential
This page was built for publication: On the Identification of Active Constraints
