An aggregate function method for nonlinear programming
From MaRDI portal
Publication:1201568
zbMath0752.90069MaRDI QIDQ1201568
Publication date: 17 January 1993
Published in: Science in China. Series A (Search for Journal in Brave)
maximum entropy principleaggregate function methodmultiplier penalty algorithmsingly constrained problemsurrogate constraint concept
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A new model for solving stochastic second-order cone complementarity problem and its convergence analysis, An efficient algorithm for the smallest enclosing ball problem in high dimensions, Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, Perturbation-based stochastic FE analysis and robust design of inelastic deformation processes, A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem, Global convergence of a smooth approximation method for mathematical programs with complementarity constraints, Topological design for vibrating structures, A smoothing SAA method for a stochastic mathematical program with complementarity constraints., Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution, Flattened aggregate function method for nonlinear programming with many complicated constraints, The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Convergence analysis of the approximation problems for solving stochastic vector variational inequality problems, A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints, An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems, Approach for layout optimization of truss structures with discrete variables under dynamic stress, displacement and stability constraints, A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems, A truncated aggregate smoothing Newton method for minimax problems, Efficient algorithms for the smallest enclosing ball problem, The aggregate constraint homotopy method for nonconvex nonlinear programming, Smooth convex approximation to the maximum eigenvalue function, Regularized smoothing approximations to vertical nonlinear complementarity problems, An active set smoothing method for solving unconstrained minimax problems, Error bounds of two smoothing approximations for semi-infinite minimax problems, Parallel optimal control with multiple shooting, constraints aggregation and adjoint methods, An aggregate homotopy method for solving unconstrained minimax problems, Entropy function-based algorithms for solving a class of nonconvex minimization problems
