In this paper, we study a semi-infinite programming (SIP) problem with a convex set constraint. Using the value function of the lower level problem, we reformulate SIP problem as a nonsmooth optimization problem. Using the theory of nonsmooth Lagrange multiplier rules and Danskin’s theorem, we...

<Para ID="Par1">Strong branching is an effective branching technique that can significantly reduce the size of the branch-and-bound tree for solving mixed integer nonlinear programming (MINLP) problems. The focus of this paper is to demonstrate how to effectively use “discarded” information from strong...</para>

We present a numerical method for solving tracking-type optimal control problems subject to scalar nonlinear hyperbolic balance laws in one and two space dimensions. Our approach is based on the formal optimality system and requires numerical solutions of the hyperbolic balance law forward in...

<Para ID="Par1">Sequential quadratic programming (SQP) methods are known to be efficient for solving a series of related nonlinear optimization problems because of desirable hot and warm start properties—a solution for one problem is a good estimate of the solution of the next. However, standard SQP solvers...</para>

<Para ID="Par1">Recent years have seen growing interest in coherent risk measures, especially in Conditional Value-at-Risk (<InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$\mathrm {CVaR}$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi mathvariant="normal">CVaR</mi> </math> </EquationSource> </InlineEquation>). Since <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$\mathrm {CVaR}$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi mathvariant="normal">CVaR</mi> </math> </EquationSource> </InlineEquation> is a convex function, it is suitable as an objective for optimization problems when we desire to minimize risk. In the...</equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation></para>

The paper proposes a primal-dual algorithm for solving an equality constrained minimization problem. The algorithm is a Newton-like method applied to a sequence of perturbed optimality systems that follow naturally from the quadratic penalty approach. This work is first motivated by the fact...

We propose a new gradient method for quadratic programming, named SDC, which alternates some steepest descent (SD) iterates with some gradient iterates that use a constant steplength computed through the Yuan formula. The SDC method exploits the asymptotic spectral behaviour of the Yuan...

In this paper, we propose a robust sequential quadratic programming (SQP) method for nonlinear programming without using any explicit penalty function and filter. The method embeds the modified QP subproblem proposed by Burke and Han (Math Program 43:277–303, <CitationRef CitationID="CR9">1989</CitationRef>) for the search direction,...</citationref>

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions are known through oracles (black-boxes) that might provide inexact information. Our approach is general and covers many instances of...

We present a class of methods for distributed optimization with event-triggered communication. To this end, we extend Nesterov’s first order scheme to use event-triggered communication in a networked environment. We then apply this approach to generalize the proximal center algorithm (PCA) for...