Exterior distance function
From MaRDI portal
Abstract: We introduce and study exterior distance function (EDF) and correspondent exterior point method (EPM) for convex optimization. The EDF is a classical Lagrangian for an equivalent problem obtained from the initial one by monotone transformation of both the objective function and the constraints. The constraints transformation is scaled by a positive scaling parameter. Thus, the EDF is a particular realization of the Nonlinear Rescaling (NR) principle. Along with the "center", the EDF has two extra tools: the barrier (scaling) parameter and the vector of Lagrange multipliers. We show that EPM generates primal - dual sequence, which converges to the primal - dual solution in value under minimum assumption on the input data. Moreover, the convergence is taking place under any fixed interior point as a "center" and any fixed positive scaling parameter, just due to the Lagrange multipliers update. If the second order sufficient optimality condition is satisfied, then the EPM converges with Q-linear rate under any fixed interior point as a "center" and any fixed, but large enough positive scaling parameter.
Recommendations
- Primal–dual exterior point method for convex optimization
- 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
- Newton-type Methods with Generalized Distances For Constrained Optimization
- A Primal-Dual Exterior Point Method for Nonlinear Optimization
- scientific article; zbMATH DE number 1070679
Cited in
(4)- Two iterative processes generated by regular vector fields in Banach spaces
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- Descent methods with computational errors in Banach spaces
- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
This page was built for publication: Exterior distance function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589184)