Semismooth and Semiconvex Functions in Constrained Optimization

DOI10.1137/0315061zbMATH Open0376.90081OpenAlexW2067547116MaRDI QIDQ4156597FDOQ4156597

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

Recommendations

• scientific article; zbMATH DE number 3975736
• Nondifferentiable optimization by smooth approximations
• An algorithm to minimize the sum of a semi-smooth function and a \(C^ 1\) function
• An introduction to the theory of nonsmooth optimization
• Second-Order Necessary Conditions in Constrained Semismooth Optimization

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Inverse and implicit function theorems forH-differentiable and semismooth functions
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Characterizations of optimal solution sets of convex infinite programs
• Title not available (Why is that?)
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
• On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
• Newton methods for solving two classes of nonsmooth equations.
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• An alternating iterative method and its application in statistical inference
• An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces
• Results of farkas type
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• On the regularity of second order cone programs and an application to solving large scale problems
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
• A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
• Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
• Spectral operators of matrices
• On the superlinear convergence in computational elasto-plasticity
• Calibration of estimator-weights via semismooth Newton method
• On the local uniqueness of solutions of variational inequalities under \(H\)-differentiability
• On parametric nonlinear programming
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
• An adaptive finite-element Moreau–Yosida-based solver for a non-smooth Cahn–Hilliard problem
• Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
• Tangencially continuous directional derivatives in nonsmooth analysis
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
• On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
• A regularization smoothing Newton method for solving nonlinear complementarity problem
• The Minimization of Semicontinuous Functions: Mollifier Subgradients
• Algebraic univalence theorems for nonsmooth functions
• The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
• An optimization model for area traffic control with link tolls
• A Newton's method for perturbed second-order cone programs
• A non-monotone regularization Newton method for the second-order cone complementarity problem
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
• A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
• Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• Tangency and differentiation: Some applications of convergence theory
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Newton's method and its use in optimization
• Optimization of robust area traffic control with equilibrium flow under demand uncertainty
• Max–min separability
• A smoothing-type algorithm for solving system of inequalities
• An approximate Newton method for non-smooth equations with finite max functions
• Properties and simplifications of constitutive time‐discretized elastoplastic operators
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• Optimization of a nonlinear area traffic control system with elastic demand
• An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
• Variational inequality approach to enforcing the non-negative constraint for advection-diffusion equations
• Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems
• Local optimization method with global multidimensional search
• Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms
• Clarke generalized Jacobian of the projection onto symmetric cones
• A new smoothing Newton method for solving constrained nonlinear equations
• On the semismoothness of projection mappings and maximum eigenvalue functions
• A vibrating string with dynamic frictionless impact
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
• A new one-step smoothing Newton method for second-order cone programming.
• The relaxed nonlinear PHSS-like iteration method for absolute value equations
• A variational inequality method for computing a normalized equilibrium in the generalized Nash game
• Analysis of a non-interior continuation method for second-order cone programming
• Solution dependence on initial conditions in differential variational inequalities
• Analysis of a smoothing Newton method for second-order cone complementarity problem
• Vector variational inequalities with cone-pseudomonotone bifunctions
• An aggregate subgradient method for nonsmooth and nonconvex minimization
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• Generalized Newton's method based on graphical derivatives
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• A subdifferential condition for calmness of multifunctions
• A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
• On almost smooth functions and piecewise smooth functions
• Some new properties of the Lagrange function and its applications
• Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
• A parametrized Newton method for nonsmooth equations with finitely many maximum functions
• A further result on an implicit function theorem for locally Lipschitz functions
• A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems
• Global projection-type error bounds for general variational inequalities
• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
• Nonsmooth bundle trust-region algorithm with applications to robust stability
• Composite proximal bundle method
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• Direct search algorithm for bilevel programming problems
• Descent methods for composite nondifferentiable optimization problems
• A new non-interior continuation method for solving the second-order cone complementarity problem
• A regularization smoothing method for second-order cone complementarity problem
• ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
• A smoothing Newton method for the second-order cone complementarity problem.
• Approximately convex functions and approximately monotonic operators
• On second derivatives for nonsmooth functions
• A method for minimizing the sum of a convex function and a continuously differentiable function
• An optimal scheme for toll pricing problem
• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function
• A smoothing Newton algorithm for weighted linear complementarity problem
• A minimization method for the sum of a convex function and a continuously differentiable function
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A proximal point algorithm for the monotone second-order cone complementarity problem

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

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