Pages that link to "Item:Q4509745"

The following pages link to On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods (Q4509745):

Displaying 50 items.

• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← links)
• Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints (Q330324) (← links)
• Relaxation approach for equilibrium problems with equilibrium constraints (Q336821) (← links)
• On the multiplier-penalty-approach for quasi-variational inequalities (Q344924) (← links)
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints (Q344949) (← links)
• Second-order optimality conditions for mathematical programs with equilibrium constraints (Q368596) (← links)
• Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
• Handling infeasibility in a large-scale nonlinear optimization algorithm (Q430999) (← links)
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
• New results on constraint qualifications for nonlinear extremum problems and extensions (Q481044) (← links)
• Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints (Q481046) (← links)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
• On error bounds for quasinormal programs (Q535085) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• Constant-rank condition and second-order constraint qualification (Q604264) (← links)
• Implications of the constant rank constraint qualification (Q623372) (← links)
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
• On approximate KKT condition and its extension to continuous variational inequalities (Q637544) (← links)
• Low order-value approach for solving var-constrained optimization problems (Q656968) (← links)
• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
• A relaxed constant positive linear dependence constraint qualification and applications (Q715075) (← links)
• On error bounds and Newton-type methods for generalized Nash equilibrium problems (Q742304) (← links)
• On relaxing the Mangasarian-Fromovitz constraint qualification (Q743477) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
• Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians (Q975359) (← links)
• Global convergence of a robust filter SQP algorithm (Q976392) (← links)
• Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
• Low order-value optimization and applications (Q1029662) (← links)
• Regularity conditions in differentiable vector optimization revisited (Q1035923) (← links)
• An approximate strong KKT condition for multiobjective optimization (Q1617113) (← links)
• A modified homotopy method for solving the principal-agent bilevel programming problem (Q1655396) (← links)
• On the minimization of possibly discontinuous functions by means of pointwise approximations (Q1686551) (← links)
• On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming (Q1715712) (← links)
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
• Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints (Q1724802) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification (Q1780602) (← links)
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
• On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming (Q2044492) (← links)
• Sequential optimality conditions for cardinality-constrained optimization problems with applications (Q2044577) (← links)
• Optimality conditions and exact penalty for mathematical programs with switching constraints (Q2046549) (← links)
• Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming (Q2082228) (← links)
• Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (Q2115314) (← links)
• R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization (Q2116024) (← links)
• On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
• On the best achievable quality of limit points of augmented Lagrangian schemes (Q2138411) (← links)