Pages that link to "Item:Q2706318"
From MaRDI portal
The following pages link to A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization (Q2706318):
Displaying 38 items.
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
- The use of QP-free algorithm in the limit analysis of slope stability (Q544226) (← links)
- A modified QP-free feasible method (Q552398) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
- A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
- A new filter QP-free method for the nonlinear inequality constrained optimization problem (Q824828) (← links)
- A modified SQP algorithm for minimax problems (Q837129) (← links)
- Piecewise linear NCP function for QP free feasible method (Q854563) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- The revised DFP algorithm without exact line search (Q1811670) (← links)
- A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse (Q1992358) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465) (← links)
- A globally convergent QP-free algorithm for nonlinear semidefinite programming (Q2360400) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
- A kind of QP-free feasible method (Q2519715) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem (Q5741070) (← links)
- Duality in convex optimization for the hyperbolic augmented Lagrangian (Q6500232) (← links)