Gauss-Newton-type methods for bilevel optimization (Q2028474): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:50, 16 December 2024

scientific article

Language	Label	Description	Also known as
English	Gauss-Newton-type methods for bilevel optimization	scientific article

Statements

scholarly article

0 references

Gauss-Newton-type methods for bilevel optimization (English)

0 references

0 references

0 references

Alain B. Zemkoho

0 references

Computational Optimization and Applications

0 references

publication date

1 June 2021

0 references

full work available at URL

https://arxiv.org/abs/2003.03128

0 references

zbMATH Keywords

bilevel optimization

0 references

value function reformulation

0 references

partial exact penalization

0 references

Gauss-Newton method

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Is bilevel programming a special case of a mathematical program with complementarity constraints?

0 references

Practical bilevel optimization. Algorithms and applications

0 references

Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

0 references

A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions

0 references

Foundations of bilevel programming

0 references

New necessary optimality conditions in optimistic bilevel programming

0 references

On an algorithm solving two-level programming problems with nonunique lower level solutions

0 references

The bilevel programming problem: reformulations, constraint qualifications and optimality conditions

0 references

The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs

0 references

0 references

A special newton-type optimization method

0 references

Generalized inverse methods for the best least squares solution of systems of non-linear equations

0 references

0 references

Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations

0 references

0 references

Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem

0 references

Some Noninterior Continuation Methods for Linear Complementarity Problems

0 references

Jacobian Smoothing Methods for Nonlinear Complementarity Problems

0 references

Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development

0 references

Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results

0 references

Numerically tractable optimistic bilevel problems

0 references

On solving simple bilevel programs with a nonconvex lower level program

0 references

Global solution of bilevel programs with a nonconvex inner program

0 references

Numerical Optimization

0 references

An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications

0 references

0 references

The semismooth approach for semi-infinite programming under the reduction ansatz

0 references

The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity

0 references

On NCP-functions

0 references

Optimization theory and methods. Nonlinear programming

0 references

Pessimistic Bilevel Optimization

0 references

A smoothing augmented Lagrangian method for solving simple bilevel programs

0 references

Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs

0 references

Optimality conditions for bilevel programming problems

0 references

BOLIB: Bilevel Optimization LIBrary of Test Problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1007/S10589-020-00254-3

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2028474

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2028474&oldid=38839657"