Algorithm model for penalty functions-type iterative pcedures
From MaRDI portal
(Redirected from Publication:1214742)
Cites work
- A Drivable Method of Feasible Directions
- A systematic approach to the synthesis of algorithms
- Abstract Models for the Synthesis of Optimization Algorithms
- Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
- Convergence Conditions for Nonlinear Programming Algorithms
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 701829 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- scientific article; zbMATH DE number 3278848 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3306320 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- On a Method of Courant for Minimizing Functionals
- Penalty Functions and Bounded Phase Coordinate Control
- Relaxed variational problems
- The Validity of a Family of Optimization Methods
- Topologies on Spaces of Subsets
Cited in
(1)
This page was built for publication: Algorithm model for penalty functions-type iterative pcedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214742)