Local convergence analysis of projection-type algorithms: unified approach
Journal of Optimization Theory and Applications
Merit Functions for Complementarity and Related Problems: A Survey
Computational Optimization and Applications
Local Convergence of a Primal-Dual Method for Degenerate Nonlinear Programming
Computational Optimization and Applications
Some recent advances in projection-type methods for variational inequalities
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Journal of Computational and Applied Mathematics
On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints
Computational Optimization and Applications
Computational Optimization and Applications
On the Newton-type method with admissible trajectories for mixed complementatiry problems
Automation and Remote Control
Mathematics of Operations Research
Improving ultimate convergence of an augmented Lagrangian method
Optimization Methods & Software - Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthday
An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization
Automatica (Journal of IFAC)
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
An active set quasi-Newton method with projected search for bound constrained minimization
Computers & Mathematics with Applications
An inexact-restoration method for nonlinear bilevel programming problems
Computational Optimization and Applications
Computers & Mathematics with Applications
Journal of Computational and Applied Mathematics
Journal of Global Optimization
Smoothing Newton method for NCP with the identification of degenerate indices
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
Active Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
SIAM Journal on Optimization
SIAM Journal on Scientific Computing
Primal-dual interior-point method for thermodynamic gas-particle partitioning
Computational Optimization and Applications
A working set SQCQP algorithm with simple nonmonotone penalty parameters
Journal of Computational and Applied Mathematics
Conjugate gradient method for the linear complementarity problem with S-matrix
Mathematical and Computer Modelling: An International Journal
A projected semismooth Newton method for problems of calibrating least squares covariance matrix
Operations Research Letters
Active-set Newton methods for mathematical programs with vanishing constraints
Computational Optimization and Applications
An improved infeasible SSLE method for constrained optimization without strict complementarity
Computers and Operations Research
On regularity conditions for complementarity problems
Computational Optimization and Applications
Hi-index | 0.01 |
We consider nonlinear programs with inequality constraints, and we focus on the problem of identifying those constraints which will be active at an isolated local solution. The correct identification of active constraints is important from both a theoretical and a practical point of view. Such an identification removes the combinatorial aspect of the problem and locally reduces the inequality constrained minimization problem to an equality constrained problem which can be more easily dealt with. We present a new technique which identifies active constraints in a neighborhood of a solution and which requires neither complementary slackness nor uniqueness of the multipliers. We also present extensions to variational inequalities and numerical examples illustrating the identification technique.