Semismooth and Semiconvex Functions in Constrained Optimization
From MaRDI portal
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
Cited in
(only showing first 100 items - show all)- 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
- A smoothing method for second order cone complementarity problem
- Characterizations of optimal solution sets of convex infinite programs
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Computation of nonautonomous invariant and inertial manifolds
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- 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
- 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
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- 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
- Second-order necessary conditions in semismooth optimization
- Second-order directional derivatives for nonsmooth functions
- 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
- Computer-aided design via optimization: A review
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Weak directional closedness and generalized subdifferentials
- Direct approach to the minimization of the maximal stress over an arch structure
- The check of optimality conditions in nonsmooth programming
- Inexact-Newton methods for semismooth systems of equations with block-angular structure
- 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
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Second-order necessary and sufficient conditions in nonsmooth optimization
- 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
- A verification method for solutions of nonsmooth equations
- Essentially smooth Lipschitz functions
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Links between functions and subdifferentials
- A semi-smooth Newton method for inverse problem with uniform noise
- A TFETI domain decomposition solver for elastoplastic problems
- 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
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- The relaxed nonlinear PHSS-like iteration method for absolute value equations
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems
- Further application of H-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions
- A generalized inexact Newton method for inverse eigenvalue problems
- A non-monotone regularization Newton method for the second-order cone complementarity problem
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Upper semismooth functions and the subdifferential determination property
- Two smooth support vector machines for -insensitive regression
- Differentiability and semismoothness properties of integral functions and their applications
- Newton methods for solving two classes of nonsmooth equations.
- Smoothing trust region methods for nonlinear complementarity problems with P₀-functions
- A strongly semismooth integral function and its application
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Note on generalized convex functions
- Outer approximation algorithm for nondifferentiable optimization problems
- Algebraic univalence theorems for nonsmooth functions
- Solving the semismooth equivalence problem
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Inexact Newton methods for solving nonsmooth equations
- On bilevel programming. I: General nonlinear cases
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- A semismooth Newton method for nonlinear symmetric cone programming
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- A perturbed version of an inexact generalized Newton method for solving nonsmooth equations
- A Newton-type algorithm for solving problems of search theory
- A smoothing inexact Newton method for generalized nonlinear complementarity problem
- A new Jacobian-like method for the polyhedral cone-constrained eigenvalue problem
- On construction of new NCP functions
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Tensor absolute value equations
- Analysis on Newton projection method for the split feasibility problem
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- A smoothing Newton method for symmetric cone complementarity problems
- A sequential homotopy method for mathematical programming problems
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- A new semismooth Newton method for solving finite-dimensional quasi-variational inequalities
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- Generalized submonotonicity and approximately convexity in Riemannian manifolds
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
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)