Duality-based regularization in a linear convex mathematical programming problem
From MaRDI portal
Publication:5310984
DOI10.1134/S0965542507040045zbMath1210.49022MaRDI QIDQ5310984
Publication date: 15 October 2007
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
dualitymathematical programmingstopping ruleregularization algorithmdual iteration regularizationlinearly convex problem
Optimality conditions for problems involving partial differential equations (49K20) Linear operators and ill-posed problems, regularization (47A52)
Related Items (21)
Inverse final observation problems for Maxwell's equations in the quasi-stationary magnetic approximation and stable sequential Lagrange principles for their solving ⋮ Regularized classical optimality conditions in iterative form for convex optimization problems for distributed Volterra-type systems ⋮ On regularization of the Lagrange principle in the optimization problems for linear distributed Volterra type systems with operator constraints ⋮ Stable sequential Lagrange principles in the inverse final observation problem for the system of Maxwell equations in the quasistationary magnetic approximation ⋮ Stable sequential Pontryagin maximum principle in optimal control problems with phase restrictions ⋮ On the iterative regularization of the Lagrange principle in convex optimal control problems for distributed systems of the Volterra type with operator constraints ⋮ Stable sequential convex programming in a Hilbert space and its application for solving unstable problems ⋮ REGULARIZATION OF PONTRYAGIN MAXIMUM PRINCIPLE IN OPTIMAL CONTROL OF DISTRIBUTED SYSTEMS ⋮ On ill-posed problems, extremals of the Tikhonov functional and the regularized Lagrange principles ⋮ Parametric dual regularization for an optimal control problem with pointwise state constraints ⋮ Regularization of the Pontryagin maximum principle in the problem of optimal boundary control for a parabolic equation with state constraints in Lebesgue spaces ⋮ Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem ⋮ Sequential stable Kuhn-Tucker theorem in nonlinear programming ⋮ The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications ⋮ Dual regularization and Pontryagin's maximum principle in a problem of optimal boundary control for a parabolic equation with nondifferentiable functionals ⋮ Dual regularization in non-linear inverse scattering problems ⋮ On the regularization of the Lagrange principle and on the construction of the generalized minimizing sequences in convex constrained optimization problems ⋮ On a quadratic minimization problem with nonuniform perturbations in the criteria and constraints ⋮ On the regularization of classical optimality conditions in a convex optimal control problem with state constraints ⋮ On regularization of the nondifferential Kuhn-Tucker theorem in a nonlinear problem for constrained extremum ⋮ Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
This page was built for publication: Duality-based regularization in a linear convex mathematical programming problem
