Solving nearly-separable quadratic optimization problems as nonsmooth equations
type: Item
instance of: scholarly article
title: Solving nearly-separable quadratic optimization problems as nonsmooth equations
zbMATH Open document ID: 1370.90169
author: Frank E. Curtis
author: Arvind U. Raghunathan
published in: Computational Optimization and Applications
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 49M05
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 49M29
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6756292
zbMATH Keywords: quadratic optimization problems
zbMATH Keywords: dual decomposition
zbMATH Keywords: complementarity problems
zbMATH Keywords: semismooth Newton methods
zbMATH Keywords: Fischer-Burmeister function
describes a project that uses: ipfilter
describes a project that uses: MATPOWER
describes a project that uses: qpDUNES
describes a project that uses: MINQ
describes a project that uses: Ipopt
MaRDI profile type: Publication
full work available at URL: s10589-017-9895-8
OpenAlex ID: W2583600481
cites work: Q3151174
cites work: Q3102800
cites work: Introduction to Stochastic Programming
cites work: On the optimal design of water distribution networks: a practical MINLP approach
cites work: Directional derivatives of the solution of a parametric nonlinear program
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: Path-following gradient-based decomposition algorithms for separable convex optimization
cites work: An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
cites work: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
cites work: Regularity Properties of a Semismooth Reformulation of Variational Inequalities
cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: Q5588268
cites work: A special newton-type optimization method
cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
cites work: Nonlinear programming without a penalty function.
cites work: Q4464636
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: A parallel quadratic programming method for dynamic optimization problems
cites work: Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
cites work: A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
cites work: A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
cites work: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
cites work: A nonsmooth version of Newton's method
cites work: A semismooth equation approach to the solution of nonlinear complementarity problems
cites work: Q4902563
cites work: The semismooth algorithm for large scale complementarity problems
cites work: Iteration complexity analysis of dual first-order methods for conic convex programming
cites work: Application of a Smoothing Technique to Decomposition in Convex Optimization
cites work: Interior-point Lagrangian decomposition method for separable convex optimization
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Smooth minimization of non-smooth functions
cites work: Q4324980
cites work: MINQ8: general definite and bound constrained indefinite quadratic programming
cites work: A line search filter approach for the system of nonlinear equations
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: The Linear Complementarity Problem
cites work: Global Optimization of Nonlinear Network Design
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q5187067
cites work: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S10589-017-9895-8
Recommended article: Solving semidefinite quadratic problems within nonsmooth optimization algorithms
Recommended article: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
Recommended article: Nonsmooth optimization via quasi-Newton methods
Recommended article: Quadratic Approximations in Convex Nondifferentiable Optimization
Recommended article: Quasi-Newton methods for solving nonlinear programming problems

Solving nearly-separable quadratic optimization problems as nonsmooth equations (Recommended article)
Recommended article: Separable standard quadratic optimization problems
Similarity Score: 0.90633684
Recommender Run: Recommender Run 3

Solving nearly-separable quadratic optimization problems as nonsmooth equations (Recommended article)
Recommended article: A Solver for Nonconvex Bound-Constrained Quadratic Optimization
Similarity Score: 0.90612805
Recommender Run: Recommender Run 3

Solving nearly-separable quadratic optimization problems as nonsmooth equations (Recommended article)
Recommended article: Algebraic solution of the problems of nonconvex quadratic programming
Similarity Score: 0.90518564
Recommender Run: Recommender Run 3

Solving nearly-separable quadratic optimization problems as nonsmooth equations (Recommended article)
Recommended article: On solvability of convex noncoercive quadratic programming problems
Similarity Score: 0.9047568
Recommender Run: Recommender Run 3

Solving nearly-separable quadratic optimization problems as nonsmooth equations (Recommended article)
Recommended article: Q3115568
Similarity Score: 0.90433824
Recommender Run: Recommender Run 3