Nonlinear programming using minimax techniques

DOI10.1007/BF00933620MaRDI QIDQ2560772zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1974

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00933620

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Cites work

• scientific article; zbMATH DE number 3476911 (Why is no real title available?)
• scientific article; zbMATH DE number 3520162 (Why is no real title available?)
• scientific article; zbMATH DE number 3532455 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• A New Method for Constrained Optimization Problems
• A new approach to variable metric algorithms
• An Algorithm for Minimax Approximation in the Nonlinear Case
• An Exact Potential Method for Constrained Maxima
• An exact penalty function for nonlinear programming with inequalities
• Non-Linear Programming Via Penalty Functions
• On conditions for optimality in least \(p\)-th approximation with \(p \to \infty\)

Cited in

(18)

• Flattened aggregate function method for nonlinear programming with many complicated constraints
• A new algorithm for minimax andl₁-norm optimization
• Direct Gravitational Search Algorithm for Global Optimisation Problems
• Yield design theory: An efficient static method formulation
• Optimization of electrical circuits
• A lower bound for the controlling parameters of the exact penalty functions
• The minimax exact penalty fuzzy function method for solving convex nonsmooth optimization problems with fuzzy objective functions
• Discrete minimax problem: Algorithms and numerical comparisons
• Nonlinear leastpth optimization and nonlinear programming
• An exact penalty function algorithm for semi-infinite programmes
• Memetic particle swarm optimization
• The smoothing conjugate gradient method for a kind of generalized polynomial complementarity problem
• A simplex grey wolf optimizer for solving integer programming and minimax problems
• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
• A smoothing iterative method for the finite minimax problem
• Solution of minimax problems using equivalent differentiable functions
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems

This page was built for publication: Nonlinear programming using minimax techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560772)