Pages that link to "Item:Q1148785"

The following pages link to Test examples for nonlinear programming codes (Q1148785):

Displaying 50 items.

• A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)
• A new sampling-based RBDO method via score function with reweighting scheme and application to vehicle designs (Q2282890) (← links)
• Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation (Q2290926) (← links)
• A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints (Q2299749) (← links)
• Monotonic grey box direct search optimization (Q2300634) (← links)
• A power penalty approach to a discretized obstacle problem with nonlinear constraints (Q2329667) (← links)
• A new smoothing method for solving nonlinear complementarity problems (Q2329997) (← links)
• Linear equalities in blackbox optimization (Q2340487) (← links)
• Derivative-free methods for mixed-integer constrained optimization problems (Q2342138) (← links)
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
• A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints (Q2354192) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints (Q2357423) (← links)
• A globally convergent QP-free algorithm for nonlinear semidefinite programming (Q2360400) (← links)
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
• A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization (Q2364355) (← links)
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization (Q2368081) (← links)
• Two differential equation systems for inequality constrained optimization (Q2372013) (← links)
• Global convergence of a new nonmonotone filter method for equality constrained optimization (Q2375740) (← links)
• New simple exact penalty function for constrained minimization (Q2376164) (← links)
• A penalty function-based differential evolution algorithm for constrained global optimization (Q2377167) (← links)
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
• A stable differential equation approach for inequality constrained optimization problems (Q2379039) (← links)
• An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
• Solving nonlinearly constrained global optimization problem via an auxiliary function method (Q2389996) (← links)
• Constrained derivative-free optimization on thin domains (Q2392122) (← links)
• Approximate KKT points and a proximity measure for termination (Q2393085) (← links)
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
• Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
• A non-monotone line search multidimensional filter-SQP method for general nonlinear programming (Q2430756) (← links)
• A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
• A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization (Q2439887) (← links)
• A new class of exact penalty functions and penalty algorithms (Q2442639) (← links)
• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization (Q2448469) (← links)
• A multiplier active-set trust-region algorithm for solving constrained optimization problem (Q2449200) (← links)
• A new penalty method for nonlinear programming (Q2458508) (← links)
• A new class of test functions for global optimization (Q2460145) (← links)
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
• Memetic particle swarm optimization (Q2468766) (← links)
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
• A review of linear and nonlinear Cauchy singular integral and integro-differential equations arising in mechanics (Q2476469) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
• Discrete filled function method for discrete global optimization (Q2487474) (← links)
• A feasible trust-region algorithm for inequality constrained optimization (Q2489190) (← links)
• A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization (Q2489456) (← links)