Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems

DOI10.1007/S10559-017-9973-ZMaRDI QIDQ681722zbMATH OpenOpenAlexFDO

Authors Yu. P. Laptin, O. A. Berezovskyi

Publication date 13 February 2018

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-017-9973-z

zbMATH Keywords

Lagrangian relaxationcondition of nonnegative definiteness of matrixconical regularizationquadratic optimization problem

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• Lagrangian regularization approach to constrained optimization problems
• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• A global optimization algorithm based on Lagrangian dual
• Exact dual bounds for some nonconvex minimax quadratic optimization problems
• scientific article; zbMATH DE number 4070633

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 194389 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• scientific article; zbMATH DE number 778134 (Why is no real title available?)
• scientific article; zbMATH DE number 3200675 (Why is no real title available?)
• A primal interior point method for the linear semidefinite programming problem
• Affine scaling algorithm fails for semidefinite programming
• An admissible dual internal point method for a linear semidefinite programming problem
• An approach to determining Shor's dual quadratic estimates
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Exactness criteria for SDP-relaxations of quadratic extremum problems
• Hit-and-run mixes fast
• Linear programming with positive semi-definite matrices
• Method of obtaining estimates in quadratic extremal problems with Boolean variables
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• On Lagrangian relaxation of quadratic matrix constraints
• Semidefinite Programming
• The ellipsoid method and its consequences in combinatorial optimization
• Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain

Cited in

(1)

• scientific article; zbMATH DE number 7306888 (Why is no real title available?)

This page was built for publication: Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681722)