Pages that link to "Item:Q1201568"
From MaRDI portal
The following pages link to An aggregate function method for nonlinear programming (Q1201568):
Displaying 17 items.
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints (Q484867) (← links)
- A new model for solving stochastic second-order cone complementarity problem and its convergence analysis (Q824745) (← links)
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
- Approach for layout optimization of truss structures with discrete variables under dynamic stress, displacement and stability constraints (Q944666) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Error bounds of two smoothing approximations for semi-infinite minimax problems (Q1048250) (← links)
- Regularized smoothing approximations to vertical nonlinear complementarity problems (Q1284038) (← links)
- A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem (Q1646189) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- A smoothing SAA method for a stochastic mathematical program with complementarity constraints. (Q1928176) (← links)
- Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- Perturbation-based stochastic FE analysis and robust design of inelastic deformation processes (Q2384188) (← links)
- Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution (Q2421451) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)