Pages that link to "Item:Q4229470"
From MaRDI portal
The following pages link to On the Accurate Identification of Active Constraints (Q4229470):
Displayed 44 items.
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- Active-set Newton methods for mathematical programs with vanishing constraints (Q1928752) (← links)
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm (Q1959233) (← links)
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems (Q1960188) (← links)
- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse (Q1992358) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- Some characterizations of error bound for non-lower semicontinuous functions (Q2067750) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- On the cost of solving augmented Lagrangian subproblems (Q2191763) (← links)
- Locally polynomial method for solving systems of linear inequalities (Q2206481) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix (Q2275573) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it (Q2343065) (← links)
- On the Newton-type method with admissible trajectories for mixed complementarity problems (Q2371594) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems (Q2434995) (← links)
- Linear and nonlinear error bounds for lower semicontinuous functions (Q2448200) (← links)
- Hybrid approach with active set identification for mathematical programs with complementarity constraints (Q2499368) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
- A superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- Directional<i>K</i>-epiderivatives and error bound (Q2996798) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems (Q4902845) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)
- Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
- The<i>p</i>-Factor-Lagrange Methods for Degenerate Nonlinear Programming (Q5452406) (← links)
- An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems (Q5737719) (← links)
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem (Q5741070) (← links)
- Local convergence behavior of some projection-type methods for affine variational inequalities (Q5929432) (← links)
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach (Q5939878) (← links)
- Pathfollowing for parametric mathematical programs with complementarity constraints (Q6088559) (← links)
- Newton-type methods for constrained optimization with nonregular constraints (Q6122341) (← links)
- New numerical methods and some applied aspects of the p-regularity theory (Q6200625) (← links)