scientific article
From MaRDI portal
Publication:3738946
zbMath0602.90122MaRDI QIDQ3738946
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polyhedral modelsquadratic programming subproblemsexact penalty function strategynonsmooth convex constrained minimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), Block-iterative surrogate projection methods for convex feasibility problems, A tilted cutting plane proximal bundle method for convex nondifferentiable optimization, Approximate solution of Hamilton-Jacobi inequality by neural networks, A bundle modification strategy for convex minimization, Interval methods for global optimization, New diagonal bundle method for clustering problems in large data sets, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, Codifferential method for minimizing nonsmooth DC functions, A truncated aggregate smoothing Newton method for minimax problems, Accelerating the regularized decomposition method for two stage stochastic linear problems, Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities., Solving semidefinite quadratic problems within nonsmooth optimization algorithms, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, Two numerical methods for optimizing matrix stability
