Pages that link to "Item:Q1321311"

The following pages link to Nonmonotone line search for minimax problems (Q1321311):

Displaying 36 items.

• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• CFD-based optimization of hovering rotors using radial basis functions for shape parameterization and mesh deformation (Q400069) (← links)
• Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
• A nonmonotone line search based algorithm for distribution center location selected (Q477492) (← links)
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
• A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
• A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)
• Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• A modified SQP algorithm for minimax problems (Q837129) (← links)
• An improved SQP algorithm for solving minimax problems (Q1021864) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• A new computational method for the functional inequality constrained minimax optimization problem (Q1356866) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• Wing aerodynamic optimization using efficient mathematically-extracted modal design variables (Q1787330) (← links)
• Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
• A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
• The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
• Algorithms for optimal signal set design (Q3427145) (← links)
• CFD-based optimization of aerofoils using radial basis functions for domain element parameterization and mesh deformation (Q3531463) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• A sequential quadratic programming algorithm for nonlinear minimax problems (Q5301244) (← links)
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems (Q5485718) (← links)
• A new nonmonotone line search technique for unconstrained optimization (Q5919724) (← links)
• On the nonmonotone line search (Q5959912) (← links)
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization (Q6175470) (← links)