scientific article; zbMATH DE number 227711

MaRDI QIDQ5287047zbMATH OpenFDO

Authors A. Kaplan, Rainer Tichatschke

Publication date 7 February 1994

zbMATH Keywords

discretizationregularizationapproximate solutionspenalty methodsill-posed semi-infinite convex optimizationprox-regularization method

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34)

Recommendations

• A new adaptive method to nonlinear semi-infinite programming
• Adaptive optimal algorithms for ill-posed problems with sourcewise represented solutions
• Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
• An adaptive proximal method for variational inequalities
• An adaptive method for constrained optimization least-squares problems
• Adaptive algorithms for relatively Lipschitz continuous convex optimization problems
• Adaptive extragradient methods for solving variational inequalities in real Hilbert spaces

Cited in

(4)

• scientific article; zbMATH DE number 841067 (Why is no real title available?)
• Proximal interior point method for convex semi-infinite programming
• Adaptivity with relaxation for ill-posed problems and global convergence for a coefficient inverse problem
• scientific article; zbMATH DE number 5177259 (Why is no real title available?)

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