scientific article; zbMATH DE number 558123

MaRDI QIDQ4289663zbMATH OpenFDO

Authors B. N. Pshenichnyĭ

Publication date 28 April 1994

zbMATH Keywords

discrete minimax problemsdual algorithmexact penalty functionlinearization methodrate of convergence

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Numerical methods based on nonlinear programming (49M37) Nonlinear algebraic or transcendental equations (65H99) Linear programming (90C05) Quadratic programming (90C20) Convex programming (90C25)

Cited in

(6)

• Applying nonlinear generalized autoregressive conditional heteroscedasticity to compensate ANFIS outputs tuned by adaptive support vector regression
• An inexact first-order method for constrained nonlinear optimization
• A representation of generalized convex polyhedra and applications
• Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
• A linearized approach for solving differentiable vector optimization problems with vanishing constraints
• Resolving the forecasting problems of overshoot and volatility clustering using ANFIS coupling nonlinear heteroscedasticity with quantum tuning

This page was built for publication:

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