Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1569656

From MaRDI portal
Publication:4763007
Jump to:navigation, search

zbMATH Open0970.49024MaRDI QIDQ4763007FDOQ4763007


Authors: I. V. Stanyukova Edit this on Wikidata


Publication date: 25 February 2001



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 4068624
  • Publication:3495552
  • A penalty method for a mixed nonlinear complementarity problem
  • An approximate penalty method with descent for convex optimization problems
  • scientific article; zbMATH DE number 4209479
  • Penalty methods for a class of non-Lipschitz optimization problems
  • Penalty-proximal methods in convex programming
  • On penalty function method for a class of nonconvex constrained optimization problems.
  • On the convergence of the penalty function method for a class of convex optimization problems in a Hilbert space
  • Improved penalty algorithm for mixed integer PDE constrained optimization problems


zbMATH Keywords

finite elements methodoptimization problemspenalty function method


Mathematics Subject Classification ID



Cited In (2)

  • An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity
  • Title not available (Why is that?)





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 Q4763007)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4763007&oldid=19044020"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 23:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki