On the Identification of Active Constraints
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Algorithms for bound constrained quadratic programming problems
- A new proof of Robinson's homeomorphism theorem for pl-normal maps
- Conditional subgradient optimization -- theory and applications
- The least slope of a convex function and the maximal monotonicity of its subdifferential
- Error bounds in mathematical programming
- Modified fixed-point equations and related iterative methods for variational inequalities
- On finite convergence and constraint identification of subgradient projection methods
- Local convergence analysis of projection-type algorithms: unified approach
- An inexact algorithm for composite nondifferentiable optimization
- Some recent advances in projection-type methods for variational inequalities
- Some developments in general variational inequalities
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- New characterizations of weak sharp minima
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- A node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method
- On the interplay between acceleration and identification for the proximal gradient algorithm
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Avoiding bad steps in Frank-Wolfe variants
- Proximal methods avoid active strict saddles of weakly convex functions
- Screening for a reweighted penalized conditional gradient method
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- An efficient implementation of a trust region method for box constrained optimization
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Functions and sets of smooth substructure: relationships and examples
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Perturbing convex multiobjecttve programs
- Generic minimizing behavior in semialgebraic optimization
- Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- A non-monotonic method for large-scale non-negative least squares
- On the convergence of an active-set method for _1 minimization
- A proximal method for composite minimization
- Identifiable Surfaces in Constrained Optimization
- An active set truncated Newton method for large-scale bound constrained optimization
- An active-constraint logic for non-linear programming
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions
- On the Identification of Active Constraints II: The Nonconvex Case
- Projected gradient methods for linearly constrained problems
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- scientific article; zbMATH DE number 567673 (Why is no real title available?)
- On branching numbers of normal manifolds
- Exposing Constraints
- Ergodic convergence in subgradient optimization
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Optimality, identifiability, and sensitivity
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- Derivative-free optimization methods for finite minimax problems
- Active-set Newton methods and partial smoothness
- Proximal gradient methods with adaptive subspace sampling
- Partial smoothness and constant rank
- 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
- The chain rule for VU-decompositions of nonsmooth functions
- Active set complexity of the away-step Frank-Wolfe algorithm
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- On the accurate identification of active set for constrained minimax problems
- scientific article; zbMATH DE number 6270281 (Why is no real title available?)
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Tangent projection equations and general variational inequalities
- Newton acceleration on manifolds identified by proximal gradient methods
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- 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 limited memory BFGS algorithm for bound constrained optimization
- Stopping rules and backward error analysis for bound-constrained optimization
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Finite termination of the optimal solution sequence in parametric optimization
- Cardinality-constrained structured data-fitting problems
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- A complexity analysis framework for active manifold identification with applications to L₀ and L_p regularization models
- On second-order weak sharp minima of general nonconvex set-constrained optimization problems
- Subspace methods for nonlinear optimization
- Identifiability, the KL property in metric spaces, and subgradient curves
- The finite termination of feasible solution sequence for optimization and variational inequality
- Identification of active component functions in finite-max minimisation via a smooth reformulation
- An inexact projected regularized Newton method for fused zero-norms regularization problems
- General variational inequalities and optimization
- Inertial Bregman proximal gradient under partial smoothness
- New active set identification for general constrained optimization and minimax problems
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- New trends in general variational inequalities
- A proximal method for identifying active manifolds
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active-set projected trust region algorithm for box constrained optimization problems
This page was built for publication: On the Identification of Active Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813207)
