Pages that link to "Item:Q3813207"
From MaRDI portal
The following pages link to On the Identification of Active Constraints (Q3813207):
Displaying 50 items.
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces (Q398639) (← links)
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)
- Optimality, identifiability, and sensitivity (Q463741) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- On the accurate identification of active set for constrained minimax problems (Q531696) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
- New active set identification for general constrained optimization and minimax problems (Q743206) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- New trends in general variational inequalities (Q829617) (← links)
- A proximal method for identifying active manifolds (Q839490) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions (Q959926) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- A new proof of Robinson's homeomorphism theorem for pl-normal maps (Q1208290) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- The least slope of a convex function and the maximal monotonicity of its subdifferential (Q1321100) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Modified fixed-point equations and related iterative methods for variational inequalities (Q1767810) (← links)
- On finite convergence and constraint identification of subgradient projection methods (Q1802955) (← links)
- Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
- An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- Some developments in general variational inequalities (Q1880886) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- New characterizations of weak sharp minima (Q1926622) (← links)
- Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
- A node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method (Q1987864) (← links)
- On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming (Q2067987) (← links)
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
