On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature

DOI10.1016/j.amc.2014.09.044zbMath1338.90290OpenAlexW2073501653MaRDI QIDQ297833

Petr Vodstrčil, Lukáš Pospíšil, Jiří Bouchala, Zdeněk Dostál, Tomáš Kozubek

Publication date: 17 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.09.044

zbMATH Keywords

rate of convergenceelliptic constraintsorthotropic frictionprecision controlQPQC with separable constraints

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (2)

On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints

Uses Software

• MatSol

Cites Work

• Unnamed Item
• Unnamed Item
• A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
• Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
• On the decrease of a quadratic function along the projected-gradient path
• On solvability of convex noncoercive quadratic programming problems
• Solving the Signorini problem on the basis of domain decomposition techniques
• Error bounds and convergence analysis of feasible descent methods: A general approach
• An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• Scalable total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering
• Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
• Lectures on Modern Convex Optimization
• An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
• Variationally consistent discretization schemes and numerical algorithms for contact problems
• Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
• KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
• Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
• Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
• Quadratically constrained quadratic programming: Some applications and a method for solution
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• A nonlinear programming approach to the unilateral contact-, and friction-boundary value problem in the theory of elasticity
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• On the Maximization of a Concave Quadratic Function with Box Constraints
• Box Constrained Quadratic Programming with Proportioning and Projections
• On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
• A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
• A Dual Method for Quadratic Programs with Quadratic Constraints
• Minimizing quadratic functions with separable quadratic constraints

This page was built for publication: On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature