Skip to main content
SpringerLink
Log in

On the Choice of Parameters in the Residual Method for the Optimal Correction of Improper Problems of Convex Optimization

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

For the correction of improper problems of convex programming, the residual method is used, which is the standard regularization procedure for ill-defined optimization models. We propose new iterative implementations of the residual method, in which the constraints of the problem are included by means of penalty functions. New convergence conditions are established for algorithmic schemes, and estimates are found for the approximation error.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. D. Skarin, “On an algorithm for optimal correction of inconsistent problems of convex programming,” in Optimization and Applications: Proceedings of the 6th International Conference, Petrovac, Montenegro, 2015, pp. 166–167.

    Google Scholar 

  2. F. P. Vasil’ev, Optimization Methods (MTsNMO, Moscow, 2011), Vols. 1, 2 [in Russian].

    Google Scholar 

  3. I. I. Eremin, Vl. D. Mazurov, and N. N. Astaf’ev, Improper Problems of Linear and Convex Programming (Nauka, Moscow, 1983) [in Russian].

    MATH  Google Scholar 

  4. V. I. Erokhin, “Matrix correction of a dual pair of improper linear programming problems,” Comp. Math. Math. Phys. 47 (4), 564–578 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  5. L. D. Popov, “Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind,” Autom. Remote Control 73 (3), 417–424 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Leon and V. Liern, “A fuzzy method to repair infeasibility in linearly constrained problems,” Fuzzy Sets and Systems 122 (2), 237–243 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  7. V. D. Skarin, “On the application of the regularization method for the correction of improper problems of convex programming,” Proc. Steklov Inst. Math. 283 (Suppl. 1), S126–S138 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  8. J. W. Chinneck and E. W. Dravnieks, “Locating minimal infeasible constraint sets in linear programs,” ORSA J. Computing 3 (2), 157–168 (1991).

    Article  MATH  Google Scholar 

  9. A. Ben-Tal and A. Nemirovski, “Robust solutions of linear programming problems contaminated with uncertain data,” Math. Progr. 88 (3), 411–424 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  10. P. de Groen, “An introduction to total least squares,” Nieuw Archief Wiskunde 14 (2), 237–254 (1996).

    MathSciNet  MATH  Google Scholar 

  11. A. Dax, “The smallest correction of an inconsistent system of linear inequalities,” Optimiz. Eng. 2, 349–359 (2001).

    Article  MATH  Google Scholar 

  12. P. Amaral and P. Barahona, “Connections between the total least squares and the correction of an infeasible system of linear inequalities,” Linear Algebra Appl. 395, 191–210 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  13. A. N. Tikhonov and V. Ya. Arsenin, Solutions of Ill-Posed Problems (Nauka, Moscow, 1979; Wiley, New York, 1981).

    MATH  Google Scholar 

  14. A. B. Bakushinskii and A. V. Goncharskii, Iterative Methods for Solving Ill-Posed Problems (Nauka, Moscow, 1989) [in Russian].

    Google Scholar 

  15. B. Kaltenbacher, A. Neubauer, and O. Scherzer, Iterative Regularization Methods for Nonlinear Ill-Posed Problems (Walter de Gruyter, Berlin, 2008).

    Book  MATH  Google Scholar 

  16. Yu. G. Evtushenko, Methods for Solving Extremal Problems and Their Application in Optimization Systems (Nauka, Moscow, 1982) [in Russian].

    MATH  Google Scholar 

  17. L. D. Popov, “On the adaptation of the least squares method to improper problems of mathematical programming,” Trudy Inst. Mat. Mekh. UrO RAN 19 (2), 247–255 (2013).

    Google Scholar 

  18. V. D. Skarin, “Barrier function method and correction algorithms for improper convex programming problems,” Proc. Steklov Inst. Math., Suppl. 2, S120–S134 (2008).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, 620990, Russia

    V. D. Skarin

  2. Ural Federal University, Yekaterinburg, 620000, Russia

    V. D. Skarin

Authors
  1. V. D. Skarin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. D. Skarin.

Additional information

Original Russian Text © V.D. Skarin, 2016, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2016, Vol. 22, No. 3.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Skarin, V.D. On the Choice of Parameters in the Residual Method for the Optimal Correction of Improper Problems of Convex Optimization. Proc. Steklov Inst. Math. 299 (Suppl 1), 191–204 (2017). https://doi.org/10.1134/S0081543817090218

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543817090218

Keywords

Search

Navigation