Semismooth and Semiconvex Functions in Constrained Optimization

DOI10.1137/0315061zbMath0376.90081OpenAlexW2067547116MaRDI QIDQ4156597

Robert Mifflin

Publication date: 1977

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: http://pure.iiasa.ac.at/id/eprint/524/1/RR-76-021.pdf

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (only showing first 100 items - show all)

Solving the semismooth equivalence problem ⋮ Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems ⋮ An aggregate subgradient method for nonsmooth and nonconvex minimization ⋮ Second-order necessary and sufficient conditions in nonsmooth optimization ⋮ Links between functions and subdifferentials ⋮ A semi-smooth Newton method for inverse problem with uniform noise ⋮ A globally convergent Newton method for convex \(SC^ 1\) minimization problems ⋮ A TFETI domain decomposition solver for elastoplastic problems ⋮ Variable metric bundle methods: From conceptual to implementable forms ⋮ A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems ⋮ Solution of monotone complementarity problems with locally Lipschitzian functions ⋮ Robust recursive quadratic programming algorithm model with global and superlinear convergence properties ⋮ Tangencially continuous directional derivatives in nonsmooth analysis ⋮ Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure ⋮ Optimality conditions for piecewise \(C^ 2\) nonlinear programming ⋮ Inexact Newton methods for solving nonsmooth equations ⋮ On bilevel programming. I: General nonlinear cases ⋮ Minimization of \(SC^ 1\) functions and the Maratos effect ⋮ A verification method for solutions of nonsmooth equations ⋮ Extended semismooth Newton method for functions with values in a cone ⋮ Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP ⋮ Second-order necessary conditions in semismooth optimization ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Essentially smooth Lipschitz functions ⋮ The relaxed nonlinear PHSS-like iteration method for absolute value equations ⋮ Second-order directional derivatives for nonsmooth functions ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems ⋮ Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity ⋮ A minimization method for the sum of a convex function and a continuously differentiable function ⋮ A maximization method for a class of quasiconcave programs ⋮ An implementable algorithm for the optimal design centering, tolerancing, and tuning problem ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ Computer-aided design via optimization: A review ⋮ Subdifferentials of compactly Lipschitzian vector-valued functions ⋮ Further application of \(H\)-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions ⋮ A generalized inexact Newton method for inverse eigenvalue problems ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Weak directional closedness and generalized subdifferentials ⋮ A non-monotone regularization Newton method for the second-order cone complementarity problem ⋮ A smoothing-type algorithm for solving system of inequalities ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ An alternating iterative method and its application in statistical inference ⋮ A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) ⋮ An efficient search algorithm for road network optimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ Sub-quadratic convergence of a smoothing Newton method for second-order cone programming ⋮ Analysis of a non-interior continuation method for second-order cone programming ⋮ Smoothing Newton method for operator equations in Banach spaces ⋮ Upper semismooth functions and the subdifferential determination property ⋮ A one-step smoothing Newton method for second-order cone programming ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces ⋮ On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability ⋮ Two smooth support vector machines for \(\varepsilon \)-insensitive regression ⋮ Computing proximal points of nonconvex functions ⋮ Solution dependence on initial conditions in differential variational inequalities ⋮ Tame functions are semismooth ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ Simultaneously optimizing link tolls and signal settings in a road network ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function ⋮ Differentiability and semismoothness properties of integral functions and their applications ⋮ Error bounds: necessary and sufficient conditions ⋮ Newton methods for solving two classes of nonsmooth equations. ⋮ Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ An optimization model for area traffic control with link tolls ⋮ On a new class parametrized Newton-like method for semismooth equations ⋮ A parametrized Newton method for nonsmooth equations with finitely many maximum functions ⋮ On the regularity of second order cone programs and an application to solving large scale problems ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ The \(SC^1\) 1property of an expected residual function arising from stochastic complementarity problems ⋮ Optimization of limited network capacity with toll settings ⋮ Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones ⋮ Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms ⋮ A regularization smoothing Newton method for solving nonlinear complementarity problem ⋮ On a semi-smooth Newton method and its globalization ⋮ Direct approach to the minimization of the maximal stress over an arch structure ⋮ A smoothing method for second order cone complementarity problem ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ The check of optimality conditions in nonsmooth programming ⋮ Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems ⋮ Computation of nonautonomous invariant and inertial manifolds ⋮ A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Note on generalized convex functions ⋮ Analysis of a smoothing Newton method for second-order cone complementarity problem ⋮ One-step smoothing Newton method for solving the mixed complementarity problem with a \(P_{0}\) function ⋮ Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ Outer approximation algorithm for nondifferentiable optimization problems ⋮ Algebraic univalence theorems for nonsmooth functions ⋮ Inexact-Newton methods for semismooth systems of equations with block-angular structure ⋮ Tangency and differentiation: Some applications of convergence theory ⋮ Nondifferential optimization via adaptive smoothing ⋮ A method for minimizing the sum of a convex function and a continuously differentiable function ⋮ Solving box constrained variational inequalities by using the natural residual with D-gap function globalization ⋮ Application of the successive relaxation method to solve extremal problems with semismooth functions

This page was built for publication: Semismooth and Semiconvex Functions in Constrained Optimization